Sciweavers

Share
TIT
2002

Upper bounds on the rate of LDPC Codes

8 years 3 months ago
Upper bounds on the rate of LDPC Codes
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 bound to a general binaryinput 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.
David Burshtein, Michael Krivelevich, Simon Litsyn
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TIT
Authors David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller
Comments (0)
books