Ternary Constant Weight Codes

Let A3(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 A3(n, d, w) are presented, and a table of exact values and bounds in the range n 10 is given.

• Type: Journal
• Year: 2002
• Where: COMBINATORICS
• Authors: Patric R. J. Östergård, Mattias Svanström
• Keywords: COMBINATORICS 2002, Maximum Cardinality, Minimum Distance, Ternary Code