Finite-length analysis of LDPC codes with large left degrees

Junan Zhang, Alon Orlitsky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Scopus citations

Abstract

Finite length analysis of low-density parity-check (LDPC) codes with large left degrees was discussed. Recursions for maximum stopping sets were calculated and used for calculating the (average) block- and bit- error probability for regular-degree LDPC codes. The block error probability was related to the code's lowest left degree.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages3
Number of pages1
StatePublished - 2002
Externally publishedYes
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: Jun 30 2002Jul 5 2002

Other

Other2002 IEEE International Symposium on Information Theory
CountrySwitzerland
CityLausanne
Period6/30/027/5/02

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Zhang, J., & Orlitsky, A. (2002). Finite-length analysis of LDPC codes with large left degrees. In IEEE International Symposium on Information Theory - Proceedings (pp. 3)