Constructions of ternary constant-composition codes with weight three

DOI10.1109/18.887875zbMath0999.94048OpenAlexW2097859923MaRDI QIDQ2705994

Mattias Svanström

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.887875

zbMATH Keywords

Johnson boundternary codeconstant-weight codesweight constraintsconstant composition

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Related Items (8)

A construction of optimal constant composition codes ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ Room squares with super-simple property ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ A new combinatorial approach to the construction of constant composition codes ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ On the constructions of constant-composition codes from perfect nonlinear functions ⋮ Optimal grid holey packings with block size 3 and 4

This page was built for publication: Constructions of ternary constant-composition codes with weight three