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

DOI10.1109/18.910589zbMath1003.94014OpenAlexW2158549933MaRDI QIDQ4544521

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 networksturbo codesTanner graphsgraph codesconcatenated tree codesmultidimensional concatenated codes

Mathematics Subject Classification ID

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

Related Items (2)

Multiple accumulated-crossover parallel concatenated SPC codes ⋮ Codes on graphs: Recent progress

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