Bit-optimal decoding of codes whose Tanner graphs are trees

DOI10.1016/S0166-218X(02)00452-3zbMath1031.94019MaRDI QIDQ1811114

E. Offer, Emina Soljanin

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

belief propagationiterative decodingTanner graphbit-optimal decodingsoft-output decoding

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Decoding (94B35)

Cites Work

• Fusion, propagation, and structuring in belief networks
• A recursive approach to low complexity codes
• An optimum symbol-by-symbol decoding rule for linear codes
• Replication decoding
• The generalized distributive law
• Factor graphs and the sum-product algorithm
• Design of capacity-approaching irregular low-density parity-check codes
• Unnamed Item
• Unnamed Item
• Unnamed Item