Constructions of ternary constant-composition codes with weight three
2000 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 46, no 7, 2644-2647 p.Article in journal (Refereed) Published
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 bound. The results presented here solve the problem for all lengths when d = 3, as well as for lengths 7, 11, and all even lengths when d = 4.
Place, publisher, year, edition, pages
2000. Vol. 46, no 7, 2644-2647 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-47550DOI: 10.1109/18.887875OAI: oai:DiVA.org:liu-47550DiVA: diva2:268446