New Upper Bounds on A(n,d)
信息论
2007-07-13 v1 离散数学
math.IT
摘要
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.
引用
@article{arxiv.cs/0508107,
title = {New Upper Bounds on A(n,d)},
author = {Beniamin Mounits and Tuvi Etzion and Simon Litsyn},
journal= {arXiv preprint arXiv:cs/0508107},
year = {2007}
}
备注
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005