Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Svanstrom, M. ; 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:

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