Strengthening the Gilbert–Varshamov bound

@article{Barg2000StrengtheningTG,
  title={Strengthening the Gilbert–Varshamov bound},
  author={A. Barg and S. Guritman and J. Simonis},
  journal={Linear Algebra and its Applications},
  year={2000},
  volume={307},
  pages={119-129}
}
  • A. Barg, S. Guritman, J. Simonis
  • Published 2000
  • Mathematics
  • Linear Algebra and its Applications
  • Abstract The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of them known in the literature. 
    12 Citations
    Bounds on codes derived by counting components in Varshamov graphs
    • K. O'Brien, P. Fitzpatrick
    • Mathematics, Computer Science
    • International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
    • 2004
    • 2
    • PDF
    Improvement of the Binary Varshamov Bound
    • D. Spasov
    • Mathematics, Computer Science
    • ICT Innovations
    • 2019
    On the Complexity of the Greedy Construction of Linear Error-Correcting Codes
    • Highly Influenced
    Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes
    • T. Jiang, A. Vardy
    • Mathematics, Computer Science
    • IEEE Transactions on Information Theory
    • 2004
    • 49
    • Highly Influenced
    • PDF
    Nonbinary Stabilizer Codes Over Finite Fields
    • 355
    • PDF
    Quantum stabilizer codes and beyond
    • 6
    • PDF
    DNA molecular recognition specificity : pairwise and in competition
    • PDF
    Segmentation of telemetry frames during message packing in wireless sensor networks

    References

    SHOWING 1-10 OF 15 REFERENCES
    Improvement on Varshamov-Gilbert lower bound on minimum Hamming distance of linear codes
    • 6
    Some results on the existence of binary linear codes
    • M. Elia
    • Mathematics, Computer Science
    • IEEE Trans. Inf. Theory
    • 1983
    • 6
    The Theory of Error-Correcting Codes
    • 7,174
    • PDF
    Theory and practice of error control codes
    • 630
    A comparison of signalling alphabets
    • 412
    Bounds on the size of linear codes
    • 147
    Eine Verallgemeinerung von BCH-Codes
    • 5
    A course in combinatorics
    • 1,549
    • PDF
    Algebraic-Geometric Codes (Translated from the Russian by the authors)
    • Mathematics and its Applications (Soviet Series)
    • 1991
    Vladut, Algebraic-Geometric Codes (Translated from the Russian by the authors)
    • Mathematics and its Applications (Soviet Series),
    • 1991