Answers are grounded in this paper and cite their sources.
We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph Gq,n,d is a graph with all vectors in Fⁿ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.
No takes yet. Share an insight, caveat, or question.
Ye et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: