Design theory
Frames for Kirkman triple systems
Discrete Mathematics
Constructions for generalized balanced tournament designs
Discrete Mathematics
Pairwise Balanced Designs with Consecutive Block Sizes
Designs, Codes and Cryptography
The Existence of Kirkman Squares—Doubly Resolvable (v,3,1)-BIBDs
Designs, Codes and Cryptography
A Construction of Optimal Constant Composition Codes
Designs, Codes and Cryptography
Discrete Applied Mathematics
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1
Discrete Applied Mathematics
Combinatorial constructions of optimal constant-composition codes
IEEE Transactions on Information Theory
The PBD-Closure of Constant-Composition Codes
IEEE Transactions on Information Theory
A class of optimal constant composition codes from GDRPs
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A generalized balanced tournament design, or a GBTD(k, m) in short, is a (km, k, k 驴 1)-BIBD defined on a km-set V. Its blocks can be arranged into an m 脳 (km 驴 1) array in such a way that (1) every element of V is contained in exactly one cell of each column, and (2) every element of V is contained in at most k cells of each row. In this paper, we present a new construction for GBTDs and show that a GBTD(4, m) exists for any integer m 驴 5 with at most eight possible exceptions. A link between a GBTD(k, m) and a near constant composition code is also mentioned. The derived code is optimal in the sense of its size.