Some new outlooks on burst error correcting capabilities of Reed-Solomon codes with applications in mobile communications
Behnam Kamali · 2002
Some bounds on the required number of parity check symbols for burst error correction are discussed. Equations determining burst error correction capabilities of Reed-Solomon (RS) codes constructed over Galois fields of characteristic two are presented. Tables providing burst error correction capabilities of RS codes constructed over GF(256) and GF(64) are provided. Some applications of RS codes in mobile communications are covered, in particular the selection of the (63,47) RS codes for Cellular Digital Packet Data (CDPD) networks is explained. One legitimate concern regarding the application of RS codes in mobile communications is the computational complexity of the RS codes standard decoding method. Three alternative decoding techniques, suitable for RS codes with low error correcting capability are described