Fast decoding of dual multipoint codes from algebraic curves up to the Kirfel-Pellikaan bound - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
wcc15-mo3-2.pdf (123.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01275736 , version 1 (18-02-2016)

Identifiers

  • HAL Id : hal-01275736 , version 1

Cite

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⟩

Collections

WCC2015
72 View
158 Download

Share

Gmail Facebook X LinkedIn More