Stopping set distribution of LDPC code ensembles

Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang

Research output: Contribution to journalConference article

7 Scopus citations

Abstract

An attempt was made to study the asymptotic behavior of two quantities: the distribution of stopping sets, and the stopping number sz.ast;-the size of the smallest nonempty stopping set in a code and use it to bound the error probability of LDPC codes with large blocklength. An expression for the normalized average stopping set distribution of regular and irregular LDPC codes was derived and used to obtain a critical fraction of the block length above which codes have exponentially many stopping sets of that size.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this