作者
Erik Agrell, Alexander Vardy, Kenneth Zeger
发表日期
2000/11
期刊
IEEE Transactions on Information Theory
卷号
46
期号
7
页码范围
2373-2395
出版商
IEEE
简介
Let A(n,d,w) denote the maximum possible number of codewords in an (n,d,w) constant-weight binary code. We improve upon the best known upper bounds on A(n,d,w) in numerous instances for n/spl les/24 and d/spl les/12, which is the parameter range of existing tables. Most improvements occur for d=8, 10, where we reduce the upper bounds in more than half of the unresolved cases. We also extend the existing tables up to n/spl les/28 and d/spl les/14. To obtain these results, we develop new techniques and introduce new classes of codes. We derive a number of general bounds on A(n,d,w) by means of mapping constant-weight codes into Euclidean space. This approach produces, among other results, a bound on A(n,d,w) that is tighter than the Johnson bound. A similar improvement over the best known bounds for doubly-constant-weight codes, studied by Johnson and Levenshtein, is obtained in the same …
引用总数
200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202418461012127141114126571051384761057
学术搜索中的文章
E Agrell, A Vardy, K Zeger - IEEE Transactions on Information Theory, 2000