A Class of Perfect Ternary Constant-Weight Codes
Designs, Codes and Cryptography
Several classes of (2m - 1,w,2 optical orthogonal codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
On equidistant constant weight codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Binary Constant Weight Codes Based on Cyclic Difference Sets
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Sets of frequency hopping sequences: bounds and optimal constructions
IEEE Transactions on Information Theory
Optimal ternary constant-weight codes of weight four and distance six
IEEE Transactions on Information Theory
Completely reducible super-simple designs with block size four and related super-simple packings
Designs, Codes and Cryptography
| Hi-index | 754.96 |
Two methods of constructing binary constant-weight codes from (1) codes over GF(q) and (2) constant-weight codes over GF(q) are presented. Several classes of binary optimum constant-weight codes are derived from these methods. In general, we show that binary optimum constant-weight codes, which achieve the Johnson bound, can be constructed from optimum codes over GF(q) which achieve the Plotkin bound. Finally, several classes of optimum constant-weight codes over GF(q) are constructed