Multilevel expander codes
Information Theory
2007-07-16 v1 math.IT
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.
Cite
@article{arxiv.cs/0502079,
title = {Multilevel expander codes},
author = {Alexander Barg and Gilles Zemor},
journal= {arXiv preprint arXiv:cs/0502079},
year = {2007}
}