The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911806718476288 |
|---|---|
| author | Liang, Xue-Bin |
| author_facet | Liang, Xue-Bin |
| contents | For any positive integer $q\geq 2$ and any real number $δ\in(0,1)$, let $α_q(n,δn)$ denote the maximum size of a subset of $\mathbb{Z}_q^n$ with minimum Hamming distance at least $δn$, where $\mathbb{Z}_q=\{0,1,\dotsc,q-1\}$ and $n\in\mathbb{N}$. The asymptotic rate function is defined by $ R_q(δ) = \limsup_{n\rightarrow\infty}\frac{1}{n}\log_qα_q(n,δn).$ The famous $q$-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 $q\geq 2$ and $0<δ<1-q^{-1}$. In the case that $q$ is an even power of a prime with $q\geq 49$, the $q$-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 $q$-ary Gilbert-Varshamov bound $R_\mathrm{GV}(δ,q)$ at a specific tangent point $δ=δ_0\in (0,1)$ of the curve $R_\mathrm{GV}(δ,q)$ for each given integer $q\geq 46$. However, the $q$-ary Gilbert-Varshamov bound $R_\mathrm{GV}(δ,q)$ at $δ=1/2$, i.e., $R_\mathrm{GV}(1/2,q)$, remains the largest known lower bound of $R_q(1/2)$ for infinitely many positive integers $q$ 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 $q$-ary Gilbert-Varshamov bound $R_\mathrm{GV}(δ,q)$ with $δ\in(0,1)$ can be improved for all but finitely many positive integers $q$. It is shown that the growth defined by $η(δ)= \liminf_{q\rightarrow\infty}\frac{1}{\log q}\log[1-δ-R_q(δ)]^{-1}$ for every $δ\in(0,1)$ has actually a nontrivial lower bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_08727 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q Liang, Xue-Bin Combinatorics Discrete Mathematics Information Theory Number Theory For any positive integer $q\geq 2$ and any real number $δ\in(0,1)$, let $α_q(n,δn)$ denote the maximum size of a subset of $\mathbb{Z}_q^n$ with minimum Hamming distance at least $δn$, where $\mathbb{Z}_q=\{0,1,\dotsc,q-1\}$ and $n\in\mathbb{N}$. The asymptotic rate function is defined by $ R_q(δ) = \limsup_{n\rightarrow\infty}\frac{1}{n}\log_qα_q(n,δn).$ The famous $q$-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 $q\geq 2$ and $0<δ<1-q^{-1}$. In the case that $q$ is an even power of a prime with $q\geq 49$, the $q$-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 $q$-ary Gilbert-Varshamov bound $R_\mathrm{GV}(δ,q)$ at a specific tangent point $δ=δ_0\in (0,1)$ of the curve $R_\mathrm{GV}(δ,q)$ for each given integer $q\geq 46$. However, the $q$-ary Gilbert-Varshamov bound $R_\mathrm{GV}(δ,q)$ at $δ=1/2$, i.e., $R_\mathrm{GV}(1/2,q)$, remains the largest known lower bound of $R_q(1/2)$ for infinitely many positive integers $q$ 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 $q$-ary Gilbert-Varshamov bound $R_\mathrm{GV}(δ,q)$ with $δ\in(0,1)$ can be improved for all but finitely many positive integers $q$. It is shown that the growth defined by $η(δ)= \liminf_{q\rightarrow\infty}\frac{1}{\log q}\log[1-δ-R_q(δ)]^{-1}$ for every $δ\in(0,1)$ has actually a nontrivial lower bound. |
| title | The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q |
| topic | Combinatorics Discrete Mathematics Information Theory Number Theory |
| url | https://arxiv.org/abs/2403.08727 |