Several properties of short LDPC codes
Abbreviated Journal Title
IEEE Trans. Commun.
concatenated systems; final length analysis; iterative decoding; short; low-density parity-check (LDPC) codes; turbo decoding; PARITY-CHECK CODES; CONVOLUTIONAL-CODES; ORDERED STATISTICS; ERROR-PROBABILITY; BOUNDS; GRAPHS; ALGORITHM; DESIGN; Engineering, Electrical & Electronic; Telecommunications
In this paper, we present several properties on minimum distance(d(min)) and girth(G(min)) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show, that the distance growth of (2, 4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large G(min) could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.
Ieee Transactions on Communications
"Several properties of short LDPC codes" (2004). Faculty Bibliography 2000s. 4879.