New Upper Bounds on A(n,d)
<|reference_start|>New Upper Bounds on A(n,d): Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds improve on the best known analytic bounds. Several new record bounds are obtained for codes with small lengths.<|reference_end|>
@article{mounits2005new,
    title={New Upper Bounds on A(n,d)},
    author={Beniamin Mounits (1), Tuvi Etzion (1) and Simon Litsyn (2) ((1)
  Technion - Israel Institute of Technology, (2) Tel Aviv University)},
    journal={arXiv preprint arXiv:cs/0508107},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0508107},
    primaryClass={cs.IT cs.DM math.IT}
}