Luo, Yuan; Vinck, A. J. Han; Fu, Fang-Wei; Chen, Wende:
On Constant Composition Codes over Zq
2003
In: IEEE Transactions on Information Theory, Jg. 49 (2003), Heft 11, S. 3010 - 3016
Artikel/Aufsatz in Zeitschrift / Fach: Informatik
Titel:
On Constant Composition Codes over Zq
Autor(in):
Luo, Yuan; Vinck, A. J. Han im Online-Personal- und -Vorlesungsverzeichnis LSF anzeigen; Fu, Fang-Wei; Chen, Wende
Erscheinungsjahr
2003
Erschienen in:
IEEE Transactions on Information Theory, Jg. 49 (2003), Heft 11, S. 3010 - 3016
ISSN
DOI

Abstract:

A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the -ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham–Sloane bound for binary constant-weight codes. In addition, three construction methods of constant-composition codes are presented, and a number of optimum constant-composition codes are obtained by using these constructions.