Distance properties of expander codes

Details Distance properties of expander codes Distance properties of expander codes

2004-09-07

arxiv.org/abs/cs/0409010v1

Computer Science

Information Theory

19 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distance properties of expander codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance properties of expander codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance properties of expander codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-343713