By Topic

Constructions of ternary constant-composition codes with weight three

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
$33 $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

1 Author(s)
M. Svanstrom ; Dept. of Electr. Eng., Linkoping Univ., Sweden

We consider the problem of determining the maximum size of a ternary code with constant composition and Hamming weight three. We give several constructions of codes having maximum size and we also present an improvement of the Johnson (1962) bound. The results presented solve the problem for all lengths when d=3, as well as for lengths 7, 11, and all even lengths when d=4

Published in:

IEEE Transactions on Information Theory  (Volume:46 ,  Issue: 7 )