A new class of group divisible designs with block size three
Journal of Combinatorial Theory Series A
Some new 2-resolvable Steiner quadruple systems
Designs, Codes and Cryptography
Pairwise Balanced Designs with Consecutive Block Sizes
Designs, Codes and Cryptography
Optimal constant weight codes over Zk and generalized designs
Discrete Mathematics
Inductive Constructions of Perfect Ternary Constant-Weight Codes with Distance 3
Problems of Information Transmission
Constant Weight Codes and Group Divisible Designs
Designs, Codes and Cryptography
A Class of Perfect Ternary Constant-Weight Codes
Designs, Codes and Cryptography
On Perfect Ternary Constant Weight Codes
Designs, Codes and Cryptography
On Group-Divisible Designs with Block Size Four and Group-Type gum1
Designs, Codes and Cryptography
A systematic approach to some block design constructions
Journal of Combinatorial Theory Series A
Group divisible designs with block size four and group type gum1 with minimum m
Designs, Codes and Cryptography
Existence of Generalized Steiner Systems GS(2,4,",2)
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
A lower bound for ternary constant weight codes
IEEE Transactions on Information Theory
On the constructions of constant-weight codes
IEEE Transactions on Information Theory
Upper bounds for constant-weight codes
IEEE Transactions on Information Theory
On the Svanstrom bound for ternary constant-weight codes
IEEE Transactions on Information Theory
Bounds and constructions for ternary constant-composition codes
IEEE Transactions on Information Theory
Constructions for q-Ary Constant-Weight Codes
IEEE Transactions on Information Theory
The Sizes of Optimal -Ary Codes of Weight Three and Distance Four: A Complete Solution
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Completely reducible super-simple designs with block size four and related super-simple packings
Designs, Codes and Cryptography
A pair of disjoint 3-GDDs of type gtu1
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Recently, Chee and Ling ("Constructions for q-ary constant-weight codes", IEEE Trans. Inf. Theory, vol. 53, no. 1, 135-146, Jan. 2007) introduced a new combinatorial construction for q-ary constant-weight codes which reveals a close connection between q-ary constant-weight codes and sets of pairwise disjoint combinatorial designs. In this paper, we study the problem of constructing optimal ternary constant-weight codes with Hamming weight four and minimum distance six using this approach. The construction here exploits completely reducible super simple designs and group divisible codes. The problem is solved leaving only two cases undetermined. Previously, the sizes of constant-weight codes of weight four and distance six were known only for those of length no greater than 10.