Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels

Author

Hof, Eran ; Sason, Igal ; Shamai, Shlomo

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa

fYear

2008

fDate

5-9 May 2008

Firstpage

26

Lastpage

30

Abstract

The performance analysis of non-binary linear block codes is studied under ML decoding where it is assumed that the transmission takes place over memoryless symmetric channels. Gallager-type bounds are derived, and the proposed bounds are exemplified for expurgated regular ensembles of non-binary low-density parity-check (LDPC) codes. These bounds are also compared with classical and recent improved sphere-packing bounds, indicating that these bounding techniques are informative for the performance evaluation of coded communication systems which incorporate non-binary coding techniques.

Keywords

block codes; linear codes; maximum likelihood decoding; parity check codes; Gallager-type bounds; ML decoding; coded communication systems; memoryless symmetric channels; nonbinary coding techniques; nonbinary linear block codes; nonbinary low-density parity-check codes; Block codes; Channel capacity; Decoding; Error probability; Jacobian matrices; Memoryless systems; Parity check codes; Performance analysis; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 2008. ITW '08. IEEE

Conference_Location

Porto

Print_ISBN

978-1-4244-2269-2

Electronic_ISBN

978-1-4244-2271-5

Type

conf

DOI

10.1109/ITW.2008.4578615

Filename

4578615