DocumentCode
1169100
Title
Error correction capabilities of binary mapped Reed-Solomon codes with parity bits appended to all symbols
Author
Hsu, C.C. ; Reed, I.S. ; Truong, T.K.
Author_Institution
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
Volume
141
Issue
4
fYear
1994
fDate
8/1/1994 12:00:00 AM
Firstpage
209
Lastpage
211
Abstract
It is shown that the class of binary codes obtained from an RS code over GF(2m) with a parity bit appended to each RS-code symbol in GF(2m) can be decoded very efficiently by an RS decoding algorithm which corrects both errors and erasures. The error correction capabilities of this-modified class of codes are discussed. It turns out that some subcodes of this class are competitive with the best-known quadratic-residue codes with similar parameters. Also this class of codes inherits the burst error correction capability from the original RS code
Keywords
Reed-Solomon codes; binary sequences; decoding; error correction codes; RS decoding algorithm; RS-code symbol; binary mapped Reed-Solomon codes; burst error correction; erasures; parity bits; subcodes;
fLanguage
English
Journal_Title
Communications, IEE Proceedings-
Publisher
iet
ISSN
1350-2425
Type
jour
DOI
10.1049/ip-com:19941311
Filename
318001
Link To Document