DocumentCode :
2621372
Title :
Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings
Author :
Interlando, José Carmelo ; Palazzo, Reginaldo, Jr.
Author_Institution :
Dept. of Commun., DECOM/FEE/UNICAMP, Campinas, Brazil
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
94
Abstract :
We propose an extension of the Berlekamp-Massey (1969) algorithm for decoding BCH codes defined over integer residue rings and for synthesizing the shortest linear feedback shift register (LFSR) that will generate a given finite sequence of elements lying also in an integer residue ring
Keywords :
BCH codes; binary sequences; decoding; BCH codes; decoding; finite sequence; integer residue rings; linear feedback shift register; modified Berlekamp-Massey algorithm; Decoding; Equations; Linear feedback shift registers; Polynomials;
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.394854
Filename :
394854
Link To Document :
بازگشت