Multilevel expander codes

zbMATH Open1086.94034MaRDI QIDQ3374403FDOQ3374403

Authors Alexander Barg, Gilles Zémor 

Publication date 9 March 2006

Full work available at URL https://arxiv.org/abs/cs/0502079

zbMATH Keywords

bipartite graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of graph theory to circuits and networks (94C15) Decoding (94B35) Other types of codes (94B60)

Abstract: We define multilevel codes on bipartite graphs that have properties analogous to multilevel serial concatenations. A decoding algorithm is described that corrects a proportion of errors equal to half the Blokh-Zyablov bound on the minimum distance. The error probability of this algorithm has exponent similar to that of serially concatenated multilevel codes.

Recommendations

• Concatenated Codes: Serial and Parallel
• Expander codes
• Distance properties of expander codes
• Codes from Expander Graphs
• On expander codes

Cited in

(3)

• Codes from Expander Graphs
• Multilevel codes and multistage decoding
• Multilevel codes based on partitioning

This page was built for publication: Multilevel expander codes

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