Title of article
On the sizes of expander graphs and minimum distances of graph codes
Author/Authors
Hّholdt، نويسنده , , Tom and Justesen، نويسنده , , Jّrn، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
9
From page
38
To page
46
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
Graph codes , Minimum distance , Eigenvalue
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600648
Link To Document