2 search results - page 1 / 1 » On Perfect Ternary Constant Weight Codes |
DCC
1999
IEEE
14 years 9 months ago
1999
IEEE
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...
72
Voted
COMBINATORICS
2002
14 years 9 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...