Concatenated tree codes: a low-complexity, high-performance approach

DOI10.1109/18.910589MaRDI QIDQ4544521zbMATH OpenOpenAlexFDO

Authors Li Ping, Keying Y. Wu

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3c2a4c6bdceb44d811400a6c04c4c3f90bd1efd3

zbMATH Keywords

Bayesian networksconcatenated tree codesgraph codesmultidimensional concatenated codesTanner graphsturbo codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Source coding (94A29)

Recommendations

• Low-complexity concatenated two-state TCM schemes with near-capacity performance
• Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
• Concatenated Codes: Serial and Parallel
• A recursive approach to low complexity codes
• Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity

Cited in

(3)

• Multiple accumulated-crossover parallel concatenated SPC codes
• Low-complexity concatenated two-state TCM schemes with near-capacity performance
• Codes on graphs: Recent progress

This page was built for publication: Concatenated tree codes: a low-complexity, high-performance approach

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