Design theory
Combinatorial theory (2nd ed.)
Combinatorial theory (2nd ed.)
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
A Construction of Optimal Constant Composition Codes
Designs, Codes and Cryptography
Discrete Applied Mathematics
Generalized balanced tournament designs and related codes
Designs, Codes and Cryptography
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1
Discrete Applied Mathematics
On constant-composition codes over Zq
IEEE Transactions on Information Theory
Combinatorial constructions of optimal constant-composition codes
IEEE Transactions on Information Theory
The PBD-Closure of Constant-Composition Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
As a common generalization of constant weight binary codes and permutation codes, constant composition codes (CCCs) have attracted recent interest due to their numerous applications. In this paper, a class of new CCCs are constructed using design-theoretic techniques. The obtained codes are optimal in the sense of their sizes. This result is established, for the most part, by means of a result on generalized doubly resolvable packings which is of combinatorial interest in its own right.