Improvement of the Binary Varshamov Bound

  • Dejan SpasovEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1110)


It has been known that a binary code with parameters [n, k, d] does exist provided that k Hamming balls with diameter d-2 may be fitted in n-dimensional binary field. This simple bound, known as the Varshamov bound, relies on the fact that the number of linear combinations of d vectors from a collection of n vectors cannot be larger than the number of combinations of d or less elements from an n-element set. In this paper, we present several results that extend this counting mechanism and improve the binary Varshamov bound.


Linear codes Greedy codes Lexicodes Gilbert-Varshamov bound Greedy algorithms 


  1. 1.
    Barg, A., Guritman, S., Simonis, J.: Strengthening the Gilbert-Varshamov bound. Linear Algebra Appl. 307(1–3), 119–129 (2000)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Gaborit, P., Zemor, G.: Asymptotic improvement of the Gilbert-Varshamov bound for linear codes. IEEE Trans. Inf. Theory 54(9), 3865–3872 (2008)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Elia, M.: Some results on the existence of binary linear codes (Corresp.). IEEE Trans. Inf. Theory 29(6), 933–934 (1983)MathSciNetCrossRefGoogle Scholar
  4. 4.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, vol. 16. Elsevier (1977)Google Scholar
  5. 5.
    Jiang, T., Vardy, A.: Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes. IEEE Trans. Inf. Theory 50(8), 1655–1664 (2004)MathSciNetCrossRefGoogle Scholar
  6. 6.
    O’Brien, K.M., Fitzpatrick, P.: Bounds on codes derived by counting components in Varshamov graphs. Des. Codes Crypt. 39(3), 387–396 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Tolhuizen, L.M.: The generalized Gilbert-Varshamov bound is implied by Turan’s theorem [code construction]. IEEE Trans. Inf. Theory 43(5), 1605–1606 (1997)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Vu, V., Wu, L.: Improving the Gilbert-Varshamov bound for q-ary codes. IEEE Trans. Inf. Theory 51(9), 3200–3208 (2005)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Computer Science and EngineeringSkopjeNorth Macedonia

Personalised recommendations