A construction of ternary constant-composition codes with weight three and minimum distance four

Abstract

We consider the problem of finding the maximal size A/sub 3/(d,w/sub 0/,w/sub 1/,w/sub 2/) of a ternary constant-composition code. We describe a construction of ternary constant-composition codes that proves A/sub 3/(4,4m+1,2,1)=(m+1)(4m+2) and A/sub 3/(4, 4m-1,2,1)=m(4m+2).