Improving the Gilbert-Varshamov Bound by Graph Spectral Method

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph Gq,n,d is a graph with all vectors in F n q as vertices where two vertices are adjacent if their Hamming distance is less than d. In this paper, we calculate the eigenvalues and eigenvectors of Gq,n,d using the properties of Cayley graph. The improved bound is associated with the minimum eigenvalue of the graph. Finally we give an algorithm to calculate the bound and linear codes which satisfy the bound.

[1]  Galyna Livshyts,et al.  Distribution of the Minimum Distance of Random Linear Codes , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[2]  Michele Elia,et al.  Some results on the existence of binary linear codes , 1983, IEEE Trans. Inf. Theory.

[3]  Vladimir I. Levenshtein,et al.  Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces , 1995, IEEE Trans. Inf. Theory.

[4]  P. Fitzpatrick,et al.  Bounds on Codes Derived by Counting Components in Varshamov Graphs , 2006 .

[5]  A. Barg,et al.  Strengthening the Gilbert–Varshamov bound , 2000 .

[6]  H. Vincent Poor,et al.  Classical, Semi-classical and Quantum Noise , 2011 .

[7]  N. Sloane.  Unsolved Problems in Graph Theory Arising from the Study of Codes , 1989 .

[8]  Alexander Vardy,et al.  Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes , 2004, IEEE Transactions on Information Theory.

[9]  Patrick Fitzpatrick,et al.  Bounds on Codes Derived by Counting Components in Varshamov Graphs , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[10]  M. Tsfasman,et al.  Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[11]  Herbert S. Wilf,et al.  Spectral bounds for the clique and independence numbers of graphs , 1986, J. Comb. Theory, Ser. B.

[12]  Ari Trachtenberg.  Designing lexicographic codes with a given trellis complexity , 2002, IEEE Trans. Inf. Theory.

[13]  T. Apostol.  Introduction to analytic number theory , 1976 .

[14]  E. Gilbert.  A comparison of signalling alphabets , 1952 .

[15]  Costas N. Georghiades,et al.  Graph Theoretic Methods in Coding Theory , 2012 .

[16]  P. Delsarte.  AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[17]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.