Recent developments in low-density parity-check codes

Wen Ching Winnie Li, Min Lu, Chenying Wang

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

5 Scopus citations


In this paper we prove two results related to low-density parity-check (LDPC) codes. The first is to show that the generating function attached to the pseudo-codewords of an LDPC code is a rational function, answering a question raised in [6]. The combinatorial information of its numerator and denominator is also discussed. The second concerns an infinite family of q-regular bipartite graphs with large girth constructed in [8]. The LDPC codes based on these graphs have attracted much attention. We show that the first few of these graphs are Ramanujan graphs.

Original languageEnglish (US)
Title of host publicationCoding and Cryptology - Second International Workshop, IWCC 2009, Proceedings
Number of pages17
StatePublished - Sep 10 2009
Event2nd International Workshop on Coding and Cryptology, IWCC 2009 - Zhangjiajie, China
Duration: Jun 1 2009Jun 5 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5557 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd International Workshop on Coding and Cryptology, IWCC 2009

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Recent developments in low-density parity-check codes'. Together they form a unique fingerprint.

Cite this