Enumeration of Optimal Ternary Constant-Composition Codes
Problems of Information Transmission
A Construction of Optimal Constant Composition Codes
Designs, Codes and Cryptography
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
Optimal grid holey packings with block size 3 and 4
Designs, Codes and Cryptography
Constructions of a class of partition difference family
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Linear size optimal q-ary constant-weight codes and constant-composition codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
We consider the problem of determining the maximum size of a ternary code with constant composition and Hamming weight three. We give several constructions of codes having maximum size and we also present an improvement of the Johnson (1962) bound. The results presented solve the problem for all lengths when d=3, as well as for lengths 7, 11, and all even lengths when d=4