Computer Science – Information Theory
Scientific paper
2010-08-10
IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 140-151, 2010
Computer Science
Information Theory
12 pages
Scientific paper
10.1109/TIT.2009.2034814
An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of $d=2w-1$ has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper provides a construction for quasicyclic optimal constant-composition and constant-weight codes of weight $w$ and distance $2w-1$ based on a new generalization of difference triangle sets. As a result, the sizes of optimal constant-composition codes and optimal constant-weight codes of weight $w$ and distance $2w-1$ are determined for all such codes of sufficiently large lengths. This solves an open problem of Etzion. The sizes of optimal constant-composition codes of weight $w$ and distance $2w-1$ are also determined for all $w\leq 6$, except in two cases.
Chee Yeow Meng
Dau Son Hoang
Ling Alan C. H.
Ling San
No associations
LandOfFree
Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-582694