ERROR-CORRECTION CAPABILITIES OF BINARY MAPPED REED-SOLOMON CODES WITH PARITY BITS APPENDED TO ALL SYMBOLS

Authors
HSU CC REED IS TRUONG TK
Citation
Cc. Hsu et al., ERROR-CORRECTION CAPABILITIES OF BINARY MAPPED REED-SOLOMON CODES WITH PARITY BITS APPENDED TO ALL SYMBOLS, IEE proceedings. Communications, 141(4), 1994, pp. 209-211
Citations number
6
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
IEE proceedings. Communications → ACNP
ISSN journal
13502425
Volume
141
Issue
4
Year of publication
1994
Pages
209 - 211
Database
ISI
SICI code
1350-2425(1994)141:4<209:ECOBMR>2.0.ZU;2-T
Abstract
It is shown that the class of binary codes obtained from an RS code ov er GF(2(m)) with a parity bit appended to each RS-code symbol in GF(2( m)) can be decoded very efficiently by an RS decoding algorithm which corrects both errors and erasures. The error correction capabilities o f this modified class of codes are discussed. It turns out that some s ubcodes of this class are competitive with the best-known quadratic-re sidue codes with similar parameters. Also this class of codes inherits the burst error correction capability from the original RS code.