Graph Configurations and Decoding Performance

DOI10.1007/3-540-45325-3_15zbMATH Open0998.94559OpenAlexW1529056205MaRDI QIDQ4550265FDOQ4550265

Authors:

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

Recommendations

• Publication:4945360
• 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?

zbMATH Keywords

Tanner graphmax-sum algorithmdecision decodingdecoding binary error correcting codes

Mathematics Subject Classification ID

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

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)