Title :
Cycle Tanner-graph codes over GF(2b)
Author :
Hu, Xiao-Yu ; Eleftheriou, Evangelos
Author_Institution :
IBM Res., Zurich Res. Lab., Ruschlikon, Switzerland
fDate :
29 June-4 July 2003
Abstract :
The average Hamming weight spectrum function of the random ensemble of regular low-density parity-check (LDPC) codes over GF(2b) when used with binary-input channels is derived. This work confirms theoretically that the near-Shannon-limit performance of Gallager´s binary LDPC codes can be significantly enhanced by moving to fields of higher order. We construct a family of error-correcting codes based on the binary representation of GF(2b) codes defined on a cycle Tanner graph, that appears to be good for both optimum decoding and iterative decoding over binary-input channels.
Keywords :
Galois fields; binary codes; cyclic codes; error correction codes; information theory; iterative decoding; parity check codes; GF(2b); Gallager´s binary LDPC codes; Hamming weight spectrum function; binary-input channels; cycle Tanner-graph codes; error-correcting codes; iterative decoding; low-density parity-check codes; near-Shannon-limit performance; optimum decoding; AWGN channels; Error correction codes; Hamming weight; Iterative decoding; Laboratories; Light rail systems; Linear code; Maximum likelihood decoding; Parity check codes; Sparse matrices;
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
DOI :
10.1109/ISIT.2003.1228101
