Codes on graphs: Recent progress

DOI10.1016/S0378-4371(01)00436-8zbMath0980.68078WikidataQ127436331 ScholiaQ127436331MaRDI QIDQ5951414

G. David jun. Forney

Publication date: 6 January 2002

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

LDPC codesWiberg thesis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Eigenvalues and expansion of bipartite graphs

Uses Software

• LDPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimality and observability of group systems
• Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
• Expander codes
• Linear-time encodable and decodable error-correcting codes
• A linear time erasure-resilient code with nearly optimal recovery
• A recursive approach to low complexity codes
• The generalized distributive law
• Factor graphs and the sum-product algorithm
• Codes on graphs: normal realizations
• Improved low-density parity-check codes using irregular graphs
• The capacity of low-density parity-check codes under message-passing decoding
• Design of capacity-approaching irregular low-density parity-check codes
• Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
• Analyzing the turbo decoder using the Gaussian approximation
• Concatenated tree codes: a low-complexity, high-performance approach
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Good error-correcting codes based on very sparse matrices
• Minimal tail-biting trellises: the Golay code and more

This page was built for publication: Codes on graphs: Recent progress