The PBD-Closure of Constant-Composition Codes

Authors:
Yeow Meng Chee;A. C.H. Ling;San Ling;Hao Shen
Affiliations:
Nanyang Technol. Univ., Singapore;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 3

Generalized balanced tournament designs and related codes

Designs, Codes and Cryptography
A class of optimal constant composition codes from GDRPs

Designs, Codes and Cryptography
Linear size optimal q-ary constant-weight codes and constant-composition codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the sizes of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.