论文信息 - On the sizes of expander graphs and minimum distances of graph codes

On the sizes of expander graphs and minimum distances of graph codes

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.

Tom Høholdt | Jørn Justesen | J. Justesen | T. Høholdt

[1] J. Sirán,et al. Moore Graphs and Beyond: A survey of the Degree/Diameter Problem , 2013 .

[2] Patrick Solé,et al. Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials , 1996, Eur. J. Comb..

[3] Jørn Justesen,et al. Performance of Product Codes and Related Structures with Iterated Decoding , 2011, IEEE Transactions on Communications.

[4] Tom Høholdt,et al. Eigenvalues and expansion of bipartite graphs , 2012, Designs, Codes and Cryptography.

[5] Walter Feit,et al. The nonexistence of certain generalized polygons , 1964 .

[6] L. Lovász. Combinatorial problems and exercises , 1979 .

[7] A. Nilli. On the second eigenvalue of a graph , 1991 .

[8] W. Haemers. Interlacing eigenvalues and graphs , 1995 .

[9] Willem H. Haemers,et al. Spectra of Graphs , 2011 .

[10] Alexander Barg,et al. Error exponents of expander codes , 2002, IEEE Trans. Inf. Theory.

[11] Tom Høholdt,et al. The Minimum Distance of Graph Codes , 2011, IWCC.

[12] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[13] Michael Doob,et al. Spectra of graphs , 1980 .

[14] D. Spielman,et al. Expander codes , 1996 .