By Topic

Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fei Gao ; Dept. of Math., Zhejiang Univ., Hangzhou, China ; Gennian Ge

Constant-composition codes (CCCs) are a generalization of constant weight codes and permutation codes. The concept of group divisible codes, an analog of group divisible designs in combinatorial design theory, was first introduced by Chee et al. This new class of codes has been shown to be useful in recursive constructions of constant-weight codes and constant-composition codes. In this paper, we consider the problem of determining the maximal sizes of ternary constant-composition codes of weight four and distance five using group divisible codes as the main tools. We determine the exact values for these parameters. The previously known results are those with code length no greater than 10.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 6 )