Title :
Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
Author :
Sakata, Shojiro ; Leonard, Douglas A. ; Jensen, Helge Elbrond ; Hoholdt, Tom
Author_Institution :
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
fDate :
7/1/1998 12:00:00 AM
Abstract :
This article gives an errata (that is erasure- and error-) decoding algorithm of one-point algebraic-geometry codes up to the Feng-Rao (1994) designed minimum distance using Sakata´s (see Proc. 1995 IEEE Int. Symp. Information Theory, Whistler, BC, Canada, 1995) multidimensional generalization of the Berlekamp-Massey (1969) algorithm and the voting procedure of Feng and Rao
Keywords :
algebraic geometric codes; coding errors; decoding; Berlekamp-Massey algorithm; Feng-Rao bound; Feng-Rao designed minimum distance; Sakata´s multidimensional generalization; algebraic geometry codes; decoding algorithm; erasure polynomials; fast erasure-and-error decoding; voting procedure; Algorithm design and analysis; Conferences; Cryptography; Decoding; Error correction codes; Galois fields; Geometry; Multidimensional systems; Polynomials; Voting;
Journal_Title :
Information Theory, IEEE Transactions on
