| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647202 | Discrete Mathematics | 2014 | 9 Pages |
Abstract
We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tom Høholdt, Jørn Justesen,