Skip to Main content Skip to Navigation
Conference papers

Fast decoding of dual multipoint codes from algebraic curves up to the Kirfel-Pellikaan bound

Abstract : Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions which have multiple poles/zeros on their defining curves. The one-point codes which are viewed as its subclass can be decoded efficiently up to the Feng-Rao bound by using the BMS algorithm with majority logic [1]. Recently we published [2] a fast method for decoding primal multipoint codes from curves based on the vectorial BMS algorithm [3]. Although the simulation shows that the method can correct most error patterns of weight up to 1/2 d_G, it is guaranteed theoretically that every error of weight only up to 1/2 (d_G − g) can be corrected, where g is the genus of the defining curve. In this paper we present a fast method for decoding dual multipoint codes from algebraic curves up to the Kirfel-Pellikaan bound, based on the vectorial BMS algorithm with majority logic.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01275736
Contributor : Jean-Pierre Tillich <>
Submitted on : Thursday, February 18, 2016 - 9:42:23 AM
Last modification on : Friday, March 2, 2018 - 5:34:02 PM
Long-term archiving on: : Thursday, May 19, 2016 - 10:29:37 AM

File

wcc15-mo3-2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01275736, version 1

Collections

Citation

Masaya Fujisawa, Shojiro Sakata. Fast decoding of dual multipoint codes from algebraic curves up to the Kirfel-Pellikaan bound. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01275736⟩

Share

Metrics

Record views

129

Files downloads

240