# Improving the Gilbert-Varshamov bound for $q$-ary codes

Abstract : Given positive integers $q$, $n$ and $d$, denote by $A_q(n,d)$ the maximum size of a $q$-ary code of length $n$ and minimum distance $d$. The famous Gilbert-Varshamov bound asserts that $A_q(n,d+1) \geq q^n / V_q(n,d)$, where $V_q(n,d)=\sum_{i=0}^d \binom{n}{i}(q-1)^i$ is the volume of a $q$-ary sphere of radius $d$. Extending a recent work of Jiang and Vardy on binary codes, we show that for any positive constant $\alpha$ less than $(q-1)/q$ there is a positive constant $c$ such that for $d \leq \alpha n, A_q(n,d+1) \geq c \frac{q^n}{ V_q(n,d)}n$. This confirms a conjecture by Jiang and Vardy.
Keywords :
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.285-288, 2005, DMTCS Proceedings
Domaine :

Littérature citée [8 références]

https://hal.inria.fr/hal-01184445
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 14:59:16
Dernière modification le : mercredi 18 octobre 2017 - 14:38:05
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 11:13:26

### Fichier

dmAE0156.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01184445, version 1

### Citation

Van H. Vu, Lei Wu. Improving the Gilbert-Varshamov bound for $q$-ary codes. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.285-288, 2005, DMTCS Proceedings. 〈hal-01184445〉

### Métriques

Consultations de la notice

## 317

Téléchargements de fichiers