Graph configurations and decoding performance

DOI10.1007/3-540-45325-3_15MaRDI QIDQ4550265zbMATH OpenOpenAlexFDO

Authors J. T. Paire, Patrick Coulton, Paddy G. Farrell

Publication date 25 November 2002

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45325-3_15

zbMATH Keywords

decision decodingdecoding binary error correcting codesmax-sum algorithmTanner graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Decoding (94B35)

Recommendations

• Graph decoding of array error-correcting codes
• Improved low-density parity-check codes using irregular graphs
• A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes
• Analysis of the relation between properties of LDPC codes and the Tanner graph
• Which codes have cycle-free Tanner graphs?

Cited in

(1)

• Graph-Based Decoding in the Presence of ISI

This page was built for publication: Graph configurations and decoding performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550265)