Combinatorial constructions of optimal constant-composition codes

Authors:
C. Ding;J. Yin
Affiliations:
Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., China;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 8

A Construction of Optimal Constant Composition Codes

Designs, Codes and Cryptography
Generalized balanced tournament designs and related codes

Designs, Codes and Cryptography
Constructions of partitioned difference families

European Journal of Combinatorics
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1

Discrete Applied Mathematics
A class of optimal constant composition codes from GDRPs

Designs, Codes and Cryptography
Equidistant frequency permutation arrays and related constant composition codes

Designs, Codes and Cryptography
Constructions of a class of partition difference family

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
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

Constant-composition codes (CCCs) are a special class of constant-weight codes. They include permutation codes as a subclass. In this correspondence, a link between CCCs and generalized double resolvable packing designs is developed, and used to construct several infinite series of optimal CCCs.