[HTML][HTML] On the sizes of expander graphs and minimum distances of graph codes
T Høholdt, J Justesen - Discrete Mathematics, 2014 - Elsevier
T Høholdt, J Justesen
Discrete Mathematics, 2014•ElsevierWe 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.
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.
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.
Elsevier
Showing the best result for this search. See all results