Multilevel expander codes
<|reference_start|>Multilevel expander codes: 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.<|reference_end|>
@article{barg2005multilevel,
    title={Multilevel expander codes},
    author={Alexander Barg and Gilles Zemor},
    journal={"Algebraic Coding Theory and Information Theory," Providence, RI:
  AMS (2005), pp. 69-83.},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0502079},
    primaryClass={cs.IT math.IT}
}