Sciweavers

2 search results - page 1 / 1
» On Perfect Ternary Constant Weight Codes
Sort
View
DCC
1999
IEEE
13 years 5 months ago
On Perfect Ternary Constant Weight Codes
We consider the space of ternary words of length n and fixed weight w with the usual Hamming distance. A sequence of perfect single error correcting codes in this space is construc...
Jack H. van Lint, Ludo M. G. M. Tolhuizen
COMBINATORICS
2002
90views more  COMBINATORICS 2002»
13 years 5 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...