DocumentCode
2730394
Title
Decoding binary expansions of low-rate Reed-Solomon codes far beyond the BCH bound
Author
Retter, Charles T.
Author_Institution
AMSRL-IS-TP, US Army Res. Lab., Aberdeen Proving Ground, MD, USA
fYear
1995
fDate
17-22 Sep 1995
Firstpage
276
Abstract
Binary expansions of low-rate Reed-Solomon codes typically are capable of correcting far more binary errors than guaranteed by the BCH bound on the Reed-Solomon code. Practical decoding algorithms that often correct beyond the true minimum distances of the binary codes are described
Keywords
BCH codes; Reed-Solomon codes; cyclic codes; decoding; error correction codes; BCH bound; binary codes; binary errors; decoding algorithms; decoding binary expansions; error correction; low-rate Reed-Solomon codes; minimum distances; Binary codes; Code standards; Distributed computing; Error correction; Error correction codes; Laboratories; Linear code; Maximum likelihood decoding; Reed-Solomon codes; Supercomputers;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.535791
Filename
535791
Link To Document