Referenced Items are not available for this document.
Recently, pseudocodewords of Tanner graphs of LDPC codes have been used to explain the behavior of iterative decoders for these codes. In this paper, finite-length pseudocodeword weight enumerators for protograph-based generalized-LDPC code ensembles are obtained. Then asymptotic results are derived from the finite-length results by letting the block length go to infinity. The asymptotic results allow us to determine whether or not the typical minimum pseudocodeword weight grows linearly with codeword length. We give examples with Hamming component codes.
Published in:
Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE
Date of Conference: Nov. 30 2009-Dec. 4 2009
- Page(s):
- 1 - 6
- ISSN :
- 1930-529X
- Print ISBN:
- 978-1-4244-4148-8
- INSPEC Accession Number:
- 11170095
- Conference Location :
- Honolulu, HI
- Digital Object Identifier :
- 10.1109/GLOCOM.2009.5425250
- Product Type:
- Conference Publications
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.
