DocumentCode
805107
Title
Upper bounds on the rate of LDPC codes
Author
Burshtein, David ; Krivelevich, Michael ; Litsyn, Simon ; Miller, Gadi
Author_Institution
Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel
Volume
48
Issue
9
fYear
2002
fDate
9/1/2002 12:00:00 AM
Firstpage
2437
Lastpage
2449
Abstract
We derive upper bounds on the rate of low-density parity-check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager´s (1963) bound to a general binary-input symmetric-output channel. We then proceed to derive tighter bounds. We also derive upper bounds on the rate as a function of the minimum distance of the code. We consider both individual codes and ensembles of codes.
Keywords
channel coding; codes; Gallager´s bound; LDPC codes rate; code ensembles; general binary-input symmetric-output channel; individual codes; low-density parity-check codes; minimum distance; reliable communication; upper bounds; Bipartite graph; Channel capacity; Iterative algorithms; Iterative decoding; Mathematics; Maximum likelihood decoding; Parity check codes; Sockets; Turbo codes; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2002.801408
Filename
1027775
Link To Document