A new algorithm for the maximum-weight clique problem
Nordic Journal of Computing
Application of cover-free codes and combinatorial designs to two-stage testing
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Enumeration of Optimal Ternary Constant-Composition Codes
Problems of Information Transmission
Binary Constant Weight Codes Based on Cyclic Difference Sets
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Heuristic algorithms for constructing binary constant weight codes
IEEE Transactions on Information Theory
New constant-weight codes from propagation rules
IEEE Transactions on Information Theory
Linear size optimal q-ary constant-weight codes and constant-composition codes
IEEE Transactions on Information Theory
Optimal ternary constant-weight codes of weight four and distance six
IEEE Transactions on Information Theory
Classification of binary constant weight codes
IEEE Transactions on Information Theory
Optimal fingerprinting strategies with one-sided error
Quantum Information & Computation
Coding theory motivated by relational databases
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Topics on optical orthogonal codes
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Hi-index | 755.14 |
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⩽24 and d⩽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⩽28 and d⩽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 way. Furthermore, we introduce the concept of doubly-bounded-weight codes, which may be thought of as a generalization of the doubly-constant-weight codes. Subsequently, a class of Euclidean-space codes, called zonal codes, is introduced, and a bound on the size of such codes is established. This is used to derive bounds for doubly-bounded-weight codes, which are in turn used to derive bounds on A(n,d,w). We also develop a universal method to establish constraints that augment the Delsarte inequalities for constant-weight codes, used in the linear programming bound. In addition, we present a detailed survey of known upper bounds for constant-weight codes, and sharpen these bounds in several cases. All these bounds, along with all known dependencies among them, are then combined in a coherent framework that is amenable to analysis by computer. This improves the bounds on A(n,d,w) even further for a large number of instances of n, d, and w