Constructions of ternary constant-composition codes with weight three

Constructions of ternary constant-composition codes with weight three

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 len...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2000-11, Vol.46 (7), p.2644-2647
1. Verfasser: Svanstrom, M.
Format: Artikel
Sprache:eng
Schlagworte:
Codes
Computer programming
Construction
Information theory
TECHNOLOGY
TEKNIKVETENSKAP
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9448
1557-9654
1557-9654
DOI:10.1109/18.887875