Referenced Items are not available for this document.
We present an iterative list decoding algorithm for low-density parity-check (LDPC) codes. In particular we apply this decoder to a class of LDPC codes from finite geometries and show that the (73,45,10) projective geometry code can be maximum-likelihood (ML) decoded with low complexity. Moreover, the list decoding approach enables us to give a theoretical analysis of the performance. We also consider list bit-flipping (BF) decoding of longer LDPC codes.
Published in:
Information Theory, IEEE Transactions on
(Volume:53
,
Issue:
11
)
Date of Publication: Nov. 2007
- Page(s):
- 4276 - 4284
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 9748493
- Digital Object Identifier :
- 10.1109/TIT.2007.907485
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 29 October 2007
- Issue Date :
- Nov. 2007
- 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.
