DocumentCode
2050227
Title
Distance properties of expander codes
Author
Barg, Alexander ; Zémor, Gilles
Author_Institution
Dept. of ECE, Maryland Univ., College Park, MD, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
5
Abstract
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 ≥3, the overall code is asymptotically good, and sometimes meets the Gilbert-Varshamov bound.
Keywords
Hamming codes; Reed-Solomon codes; binary codes; linear codes; Gilbert-Varshamov bound; bipartite-graph code; expander code; Bipartite graph; Distributed computing; Educational institutions; Equations; Graph theory; Linear code; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365044
Filename
1365044
Link To Document