COMBINATORICS
2002
14 years 4 months ago
2002
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...
COMBINATORICS
2007
14 years 4 months ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...