Referenced Items are not available for this document.
We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager's decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.
Published in:
Information Theory, IEEE Transactions on
(Volume:50
,
Issue:
10
)
Date of Publication: Oct. 2004
- Page(s):
- 2483 - 2492
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8146994
- Digital Object Identifier :
- 10.1109/TIT.2004.834845
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 27 September 2004
- Issue Date :
- Oct. 2004
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
