Distance properties of expander codes
<|reference_start|>Distance properties of expander codes: We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall code is asymptotically good, and sometimes meets the Gilbert-Varshamov bound.   Constructive families of expander codes are presented whose minimum distance asymptotically exceeds the product bound for all code rates between 0 and 1.<|reference_end|>
@article{barg2004distance,
    title={Distance properties of expander codes},
    author={Alexander Barg and Gilles Zemor},
    journal={arXiv preprint arXiv:cs/0409010},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0409010},
    primaryClass={cs.IT cs.DM math.IT}
}