Asymptotic Improvement of the Gilbert-Varshamov Bound for Linear Codes

The Gilbert-Varshamov (GV) 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)ges2 n /V(n, d-1) where V(n, d)=Sigma i=0 d ( i n ) stands for the volume of a Hamming ball of radius d. Recently, Jiang and Vardy showed that for binary n...

Ausführliche Beschreibung