On Expanders Graphs: Parameters and Applications

Details On Expanders Graphs: Parameters and Applications On Expanders Graphs: Parameters and Applications

2004-06-25

arxiv.org/abs/cs/0406048v1

Computer Science

Information Theory

Submitted to SIAM J. DAM on Feb. 1, 2001

Scientific paper

We give a new lower bound on the expansion coefficient of an edge-vertex graph of a $d$-regular graph. As a consequence, we obtain an improvement on the lower bound on relative minimum distance of the expander codes constructed by Sipser and Spielman. We also derive some improved results on the vertex expansion of graphs that help us in improving the parameters of the expander codes of Alon, Bruck, Naor, Naor, and Roth.

Affiliated with

Also associated with

No associations

Rating

On Expanders Graphs: Parameters and Applications 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 On Expanders Graphs: Parameters and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Expanders Graphs: Parameters and Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-206314