On circulant self-dual codes over small fields
Designs, Codes and Cryptography
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
| Hi-index | 754.84 |
The Gilbert-Varshamov (GV) bound states that the maximum size A2(n, d) of a binary code of length n and minimum distance d satisfies A2(n, d)ges2n/V(n, d-1) where V(n, d)=Sigmai=0 d(i n) stands for the volume of a Hamming ball of radius d. Recently, Jiang and Vardy showed that for binary nonlinear codes this bound can be improved to A2(n, d)gescn2n/(V(n, d-1)) for c a constant and d/nges0.499. In this paper, we show that certain asymptotic families of linear binary [n, n/2] random double circulant codes satisfy the same improved GV bound.