Referenced Items are not available for this document.
This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes.
Published in:
Information Theory, IEEE Transactions on
(Volume:55
,
Issue:
1
)
Date of Publication: Jan. 2009
- Page(s):
- 27 - 32
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 10370502
- Digital Object Identifier :
- 10.1109/TIT.2008.2008118
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 22 December 2008
- Issue Date :
- Jan. 2009
- 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.
