Combinatorial constructions of low-density parity check codes for iterative decoding

Research output: Contribution to journalConference article

15 Scopus citations

Abstract

A combinatorial construction of regular low-density parity check (LDPC) codes was introduced based on balanced incomplete block designs (BIBD). Several constructions were presented and the bounds on minimal distance were derived by using the concept of Pasch configuration. The bounds on the minimum distance of the BIBD codes were solely functional on the parity check matrix column weight.

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 'Combinatorial constructions of low-density parity check codes for iterative decoding'. Together they form a unique fingerprint.

  • Cite this