Distance properties of expander codes

@article{Barg2004DistancePO,
  title={Distance properties of expander codes},
  author={Alexander Barg and Gilles Z{\'e}mor},
  journal={International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.},
  year={2004},
  pages={5-}
}
A constructive family of expander codes is presented whose minimum distance exceeds the product (Zyablov) bound for all code rates between 0 and 1. Weight spectrum and the minimum distance of a random ensemble of bipartite-graph codes are computed. It is shown that if the vertex codes have minimum distance /spl ges/3, the overall code is asymptotically good, and sometimes meets the Gilbert-Varshamov bound. 
Highly Cited
This paper has 55 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

56 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Error exponents of expander codes

IEEE Trans. Information Theory • 2002
View 2 Excerpts

Similar Papers

Loading similar papers…