Sciweavers

COMBINATORICS
2002
90views more  COMBINATORICS 2002»
13 years 11 months ago
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...
Patric R. J. Östergård, Mattias Svanstr...
COMBINATORICS
2007
86views more  COMBINATORICS 2007»
13 years 11 months ago
Lower Bounds for the Football Pool Problem for 7 and 8 Matches
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...
Wolfgang Haas