Ja n 20 06 Improved Nearly - MDS Expander Codes ∗

Abstract

A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace… (More)

Topics

1 Figure or Table

Cite this paper

@inproceedings{Roth2004JaN2, title={Ja n 20 06 Improved Nearly - MDS Expander Codes ∗}, author={Ron M. Roth and Vitaly Skachek}, year={2004} }