Asymptotic improvement of the Gilbert-Varshamov bound for binary linear codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 287-291

  Gaborit, Philippe ^a   Zémor, Gilles ^b  

^a UNIVERSITY OF LIMOGES   (France)

^b TELECOM PARISTECH   (France)

Author keywords

Double circulant codes; Gilbert Varshamov bound; Linear codes; Random coding

Indexed keywords

DOUBLE CIRCULANT CODES; GILBERT-VARSHAMOV BOUND; GILBERT-VARSHAMOV BOUNDS; HAMMING BALL; LINEAR CODES; RANDOM CODING;

ASYMPTOTIC ANALYSIS; BRANCH AND BOUND METHOD; HAMMING DISTANCE; LINEAR NETWORKS; RANDOM PROCESSES;

BINARY CODES;

EID: 34547440660     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261851     Document Type: Conference Paper

References (15)

1. C. L. Chen, W. W. Peterson and E. J. Weldon, "Some results on quasicyclic codes," Inform. Control, Vol. 15, no. 5, pp. 407-423, 1969.
2. V. V. Chepyzhov, "New lower bounds for minimum distance of linear quasi-cyclic and almost linear cyclic codes," Problemy Peredachi Informatsii, Vol. 28, no 1, pp. 39-51, 1992.
3. P. Gaborit and G. Zémor, "On the construction of dense lattices with a given automorphism group," http://arxiv.org/abs/math.NT/ 0605098
4. E. N. Gilbert, " A comparison of signalling alphabets", Bell. Sys. Tech. J., 31, pp. 504-522, 1952.
5. T. Jiang and A. Vardy, "Asymptotic improvement of the GilbertVarshamov bound on the size of binary codes," IEEE Trans. Inf. Theory, Vol. 50, no. 8, pp. 1655-1664, 2004.
6. G. A. Kabatiyanskii, "On the existence of good cyclic almost linear codes over non prime fields", Problemy Peredachi Informatsii, Vol. 13, no 3, pp. 18-21, 1977.
7. M. Karlin, " New binary coding results by circulant", IEEE Trans. Inform. Theory 15, pp. 81-92, 1969.
8. T. Kasami, "A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2," IEEE Trans. Inf. Theory, Vol. 20, no. 5, pp. 679-679, 1974.
9. M. Krivelevich, S. Litsyn, A. Vardy, "A lower bound on the density of sphere packings via graph theory", Int. Math. Res. Not, no. 43, 22712279, 2004.
10. E. Krouk, "On codes with prescribed group of symmetry," Voprosy Kibernetiki, Vol. 34, pp. 105-112, 1977.
11. E. Krouk and S. Semenov, "On the existence of good quasi-cyclic codes," proc. of 7th joint Swedish-Russian International Workshop on Information Theory, St-Petersburg, Russia, june 1995, pp. 164-166.
12. F.J. MacWilliams and N.J.A. Sloane, "The Theory of Error-Correcting Codes," North-Holland, Amsterdam 1977.
13. M. A. Tsfasman, S.G. Vladuts and Zink, "Modular curves, Shimura curves and Goppa codes better than Varshamov-Gilbert bound", Math. Nach., 104, pp. 13-28, 1982.
14. R.R. Varshamov, "Estimate of the number of signals in error-correcting codes", Dokl. Acad. Nauk, 117, pp. 739-741, 1957 (in Russian).
15. V. Vu and L. Wu, "Improving the Gilbert-Varshamov bound for q-ary codes", IEEE Trans. Inf. Theo., 51 (9), pp. 3200-3208, 2005