Asymptotic improvement of the Gilbert-Varshamov bound for linear codes
Langue
en
Article de revue
Ce document a été publié dans
IEEE Transactions on Information Theory. 2008-09, vol. 54, n° 9, p. 3865-3872
Institute of Electrical and Electronics Engineers
Résumé en anglais
The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. ...Lire la suite >