Ternary Constant Weight Codes

Patric R. J. Östergård, Mattias Svanström

Abstract


Let $A_3(n,d,w)$ denote the maximum cardinality of a ternary code with length $n$, minimum distance $d$, and constant Hamming weight $w$. Methods for proving upper and lower bounds on $A_3(n,d,w)$ are presented, and a table of exact values and bounds in the range $n \leq 10$ is given.


Full Text: PDF