DocumentCode :
1523612
Title :
Errors-and-erasures decoding of BCH codes
Author :
Fitzpatrick, P.
Author_Institution :
Dept. of Math., Univ. Coll. Cork, Ireland
Volume :
146
Issue :
2
fYear :
1999
fDate :
4/1/1999 12:00:00 AM
Firstpage :
79
Lastpage :
81
Abstract :
A Grobner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modified syndrome polynomial is given. The decoding problem is viewed as an instance of a more general interpolation problem. The algorithm has the same computational complexity as the Berlekamp-Massey algorithm but is more efficient in hardware
Keywords :
BCH codes; computational complexity; decoding; error correction codes; interpolation; BCH codes; Berlekamp-Massey algorithm; Grobner basis algorithm; computational complexity; errors-and-erasures decoding; interpolation problem;
fLanguage :
English
Journal_Title :
Communications, IEE Proceedings-
Publisher :
iet
ISSN :
1350-2425
Type :
jour
DOI :
10.1049/ip-com:19990129
Filename :
771463
Link To Document :
بازگشت