DocumentCode
3064723
Title
Fast erasure and error decoding of algebraic geometry codes up to the Feng-Rao bound
Author
Sakata, Shojiro ; Leonard, Douglas A. ; Jensen, Helge Elbrønd ; Høholdt, Tom
Author_Institution
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
382
Abstract
We present an erasure- and error decoding algorithm of one-point algebraic geometry codes up to the Feng-Rao designed distance using Sakata´s (see Proceedings of the 1995 IEEE-ISIT, Whistler, Canada) multidimensional generalization of the Berlekamp-Massey algorithm and the voting procedure of Feng and Rao (1993)
Keywords
BCH codes; algebraic geometric codes; coding errors; decoding; BCH codes; Berlekamp-Massey algorithm; Feng and Rao; Sakata´s multidimensional generalization; error decoding algorithm; fast erasure; one-point algebraic geometry codes; Algorithm design and analysis; Code standards; Computer errors; Decoding; Geometry; Iterative algorithms; Mathematics; Multidimensional systems; Polynomials; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613319
Filename
613319
Link To Document