Multilevel expander codes
Alexander Barg, Gilles Zémor · 2005
We define multilevel codes on bipartite graphs which have properties analogous to multilevel serial concatenations. A linear-time decoding algorithm is described that corrects a proportion of errors equal to half the Blokh-Zyablov bound. The error probability of this algorithm has exponent similar to that of serially concatenated multilevel codes, i.e. equals the best-known exponent achievable by a polynomial-time decoding algorithm