Title

Several properties of short LDPC codes

Authors

Authors

L. Wei

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

IEEE Trans. Commun.

Keywords

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

Abstract

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.

Journal Title

Ieee Transactions on Communications

Volume

52

Issue/Number

5

Publication Date

1-1-2004

Document Type

Article

Language

English

First Page

721

Last Page

727

WOS Identifier

WOS:000221576200010

ISSN

0090-6778

Share

COinS