DocumentCode
2620804
Title
Generalized Berlekamp-Massey decoding of algebraic geometry codes up to half the Feng-Rao bound
Author
Sakata, Shojiro ; Jensen, Helge Elbørnd ; Høholdt, Tom
Author_Institution
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
153
Abstract
Summary form only given, as follows. Efficient decoding of BCH- and Reed-Solomon codes can be done using the Berlekanp-Massey (1969) algorithm, and it is natural to try to use the extension of this to N dimensions of Sakata (see Inform. Computat., vol.84, no.2, p.207, 1990) to decode algebraic geometry codes. We treat a general class of algebraic geometry codes and show how to decode these up to half the Feng-Rao (see IEEE Trans. Inform. Theory, vol.IT 39, no.1 p.37-45, 1993) bound, using an extension and modification of the Sakata algorithm
Keywords
BCH codes; Reed-Solomon codes; algebraic geometric codes; decoding; BCH codes; Feng-Rao bound; Reed-Solomon codes; Sakata algorithm; algebraic geometry codes; generalized Berlekamp-Massey decoding; Computational geometry; Computer science; Conferences; Decoding; Error correction; Information geometry; Information theory; Mathematics; Registers;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394818
Filename
394818
Link To Document