Distance properties of expander codes

@article{Barg2006DistancePO,
  title={Distance properties of expander codes},
  author={Alexander Barg and Gilles Z{\'e}mor},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={78-90}
}
The minimum distance of some families of expander codes is studied, as well as some related families of codes defined on bipartite graphs. The weight spectrum and the minimum distance of a random ensemble of such codes are computed and it is shown that it sometimes meets the Gilbert-Varshamov (GV) bound. A lower bound on the minimum distances of constructive families of expander codes is derived. The relative minimum distance of the expander code is shown to exceed the product bound, i.e., the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
6 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

An estimate of complexity of constructing binary linear cascade codes

  • V. V. Zyablov
  • Probl. Inf. Transm., vol. 7, no. 1, pp. 3–10, Jan…
  • 1971
Highly Influential
5 Excerpts

Linear Concatenated Codes (in Russian)

  • E. L. Blokh, V. V. Zyablov
  • Moscow, U.S.S.R.: Nauka,
  • 1982
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…