Some new outlooks on burst error correcting capabilities of Reed-Solomon codes with applications in mobile communications

Author

Kamali, Behnam

Author_Institution

Dept. of Electr. & Comput. Eng., Mercer Univ., Macon, GA, USA

Volume

1

fYear

1998

fDate

21-21 May 1998

Firstpage

343

Abstract

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

Keywords

Galois fields; Reed-Solomon codes; cellular radio; computational complexity; data communication; decoding; error correction codes; land mobile radio; packet radio networks; CDPD networks; Cellular Data Digital Packet; Galois fields; PCS networks; RS codes; Reed-Solomon codes; bounds; burst error correction; cellular networks; computational complexity; equations; mobile communications; parity check symbols; standard decoding method; Cellular networks; Computational complexity; Decoding; Equations; Error correction; Error correction codes; Galois fields; Mobile communication; Parity check codes; Reed-Solomon codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 1998. VTC 98. 48th IEEE

Conference_Location

Ottawa, Ont., Canada

ISSN

1090-3038

Print_ISBN

0-7803-4320-4

Type

conf

DOI

10.1109/VETEC.1998.686592

Filename

686592