Finite-length analysis of LDPC codes with large left degrees

Junan Zhang, Alon Orlitsky

Research output: Contribution to journalConference article

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)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Sep 12 2002
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: Jun 30 2002Jul 5 2002

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Finite-length analysis of LDPC codes with large left degrees'. Together they form a unique fingerprint.

  • Cite this