A systematic construction of capacity-achieving irregular low-density parity-check codes

Sundararajan Sankaranarayan, Bane Vasić, Erozan Kurtas

Research output: Contribution to journalConference articlepeer-review


The low density parity check (LDPC) codes from irregular bipartite graphs were analyzed. A method was proposed to split columns and rows of parity check matrix of regular LDPC code to construct capacity achieving irregular LDPC code with a given distribution. The process of splitting rows and columns of a regular LDPC code preserves the number of edges in the irregular graph.

Original languageEnglish (US)
Pages (from-to)DT09
JournalDigests of the Intermag Conference
StatePublished - 2003
EventIntermag 2003: International Magnetics Conference - Boston, MA, United States
Duration: Mar 28 2003Apr 3 2003

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this