Multilevel expander codes
Alexander Barg, Gilles Zemor
TL;DR
This paper introduces multilevel expander codes on bipartite graphs, with a decoding algorithm capable of correcting errors up to the Blokh-Zyablov bound, achieving error exponents comparable to serial multilevel codes.
Contribution
It proposes a novel multilevel code construction using bipartite graphs and a decoding algorithm that attains near-optimal error correction performance.
Findings
Decoding corrects errors up to the Blokh-Zyablov bound
Error probability exponent similar to serial multilevel codes
New multilevel code structure with expander graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Coding theory and cryptography · DNA and Biological Computing