Strengthening the Gilbert–Varshamov bound-Reference-Cited by-同舟云学术

Strengthening the Gilbert–Varshamov bound

Published:2000-03 Issue:1-3 Volume:307 Page:119-129
ISSN:0024-3795
Container-title:Linear Algebra and its Applications
language:en
Short-container-title:Linear Algebra and its Applications

Author:

Barg Alexander,Guritman Sugi,Simonis Juriaan

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory

Reference13 articles.

1. R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, Reading, MA, 1983

2. A.E. Brouwer, Bounds on the size of linear codes, in: V. Pless, W. Cary Huffman (Eds.), Handbook of Coding Theory, Elsevier, Amsterdam, 1998. Online version of the tables: http://www.win.tue.nl/math/dw/voorlincod.html

3. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl. 10 (1973)

4. Y. Edel, Eine Verallgemeinerung von BCH-Codes, Ph.D. Thesis, University of Heidelberg, 1996

5. Some results on the existence of binary linear codes;Elia;IEEE Trans. Inform. Theory,1983

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving the Gilbert-Varshamov Bound by Graph Spectral Method;CSIAM Transactions on Applied Mathematics;2023-06

2. New Bounds on the Size of Binary Codes With Large Minimum Distance;IEEE Journal on Selected Areas in Information Theory;2023

3. The clique distribution in powers of hypercubes;Discrete Applied Mathematics;2021-12

4. Improvement of the Binary Varshamov Bound;Communications in Computer and Information Science;2019

5. Hamming Distance as a Concept in DNA Molecular Recognition;ACS Omega;2017-04-05