Recent Developments in Low-Density Parity-Check Codes

DOI10.1007/978-3-642-01877-0_11zbMath1248.94121OpenAlexW1716889240MaRDI QIDQ5323003

Min Lu, Chenying Wang, Wen-Ch'ing Winnie Li

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01877-0_11

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial codes (94B25)

Related Items

The eigenvalues of the graphs \(D(4,q)\), On some cycles in linearized Wenger graphs, On the spectrum of Wenger graphs, A simple proof for the lower bound of the girth of graphs \(D(n,q)\), On the eigenvalues of the graphs \(D(5,q)\), Explicit non-malleable codes from bipartite graphs, On some cycles in Wenger graphs

Cites Work

• Unnamed Item
• Ramanujan graphs
• Explicit construction of graphs with an arbitrary large girth and of large size
• Zeta functions of finite graphs and coverings
• Characterizations of pseudo-codewords of (low-density) parity-check codes
• Computing the Continuous Discretely
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• On the Dimensions of Certain LDPC Codes Based on$q$-Regular Bipartite Graphs
• Lectures on Polytopes