TY - GEN
T1 - Recent developments in low-density parity-check codes
AU - Li, Wen Ching Winnie
AU - Lu, Min
AU - Wang, Chenying
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=69849098549&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=69849098549&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-01877-0_11
DO - 10.1007/978-3-642-01877-0_11
M3 - Conference contribution
AN - SCOPUS:69849098549
SN - 3642018130
SN - 9783642018138
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 107
EP - 123
BT - Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings
T2 - 2nd International Workshop on Coding and Cryptology, IWCC 2009
Y2 - 1 June 2009 through 5 June 2009
ER -