DocumentCode :
2063287
Title :
Bounds and constructions for q-ary constant composition codes
Author :
Luo, Yuan ; Fu, Fang-Wei ; Vinck, A. J Han ; Chen, Wende
Author_Institution :
Inst. for Exp. Math., Essen Univ., Germany
fYear :
2002
fDate :
2002
Firstpage :
485
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 paper, we give an asymptotically optimal lower bound for the maximum size of the q-ary constant composition codes with minimum distance at least 3. In addition, a number of optimum constant composition codes are obtained by using three constructions.
Keywords :
codes; asymptotically optimal lower bound; code construction; coding theory; constant composition codes; constant weight code; maximum size; minimum distance; optimum codes; q-ary codes; Codes; Laboratories; Mathematics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023757
Filename :
1023757
Link To Document :
بازگشت