The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
arXiv:2403.08727
Abstract
For any positive integer and any real number , let denote the maximum size of a subset of with minimum Hamming distance at least , where and . The asymptotic rate function is defined by The famous -ary asymptotic Gilbert-Varshamov bound, obtained in the 1950s, states that \[ R_q(δ) \geq 1 - δ\log_q(q-1)-δ\log_q\frac{1}δ-(1-δ)\log_q\frac{1}{1-δ} \stackrel{\mathrm{def}}{=}R_\mathrm{GV}(δ,q) \] for all positive integers and . In the case that is an even power of a prime with , the -ary Gilbert-Varshamov bound was firstly improved by using algebraic geometry codes in the works of Tsfasman, Vladut, and Zink and of Ihara in the 1980s. These algebraic geometry codes have been modified to improve the -ary Gilbert-Varshamov bound at a specific tangent point of the curve for each given integer . However, the -ary Gilbert-Varshamov bound at , i.e., , remains the largest known lower bound of for infinitely many positive integers which is a generic prime and which is a generic non-prime-power integer. In this paper, by using codes from geometry of numbers introduced by Lenstra in the 1980s, we prove that the -ary Gilbert-Varshamov bound with can be improved for all but finitely many positive integers . It is shown that the growth defined by for every has actually a nontrivial lower bound.
35 pages; more relevant and connected works are mentioned and referenced, with a suitable but slight adjustment for presentation in Abstract and Introduction