On diameter perfect constant-weight ternary codes
<|reference_start|>On diameter perfect constant-weight ternary codes: From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight $n-1$ (where $n$ is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before. Keywords: constant-weight codes, ternary codes, perfect codes, diameter perfect codes, perfect matchings, Preparata codes<|reference_end|>
@article{krotov2005on,
    title={On diameter perfect constant-weight ternary codes},
    author={Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)},
    journal={Discrete Math. 308(14) 2008, 3104-3114},
    year={2005},
    doi={10.1016/j.disc.2007.08.037},
    archivePrefix={arXiv},
    eprint={math/0509620},
    primaryClass={math.CO cs.IT math.IT}
}