Asymptotic improvement of the GilbertVarshamov bound for linear codes”, ISIT 2006
by
Gilles Zémor
| Citations: | 6 - 2 self |
BibTeX
@MISC{Zémor_asymptoticimprovement,
author = {Gilles Zémor},
title = {Asymptotic improvement of the GilbertVarshamov bound for linear codes”, ISIT 2006},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The Gilbert-Varshamov bound states that the maximum size A2(n, d) of a binary code of length n and minimum distance d satisfies A2(n, d) ≥ 2n /V (n, d −1) where V (n, d) = ∑d n i=0 i stands for the volume of a Hamming ball of radius d. Recently Jiang and Vardy showed that for binary non-linear codes this bound can be improved to 2 A2(n, d) ≥ cn
