English

On diameter perfect constant-weight ternary codes

Combinatorics 2009-08-03 v2 Information Theory math.IT

Abstract

From cosets of binary Hamming codes we construct diameter perfect constant-weight ternary codes with weight n1n-1 (where nn 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

Keywords

Cite

@article{arxiv.math/0509620,
  title  = {On diameter perfect constant-weight ternary codes},
  author = {Denis Krotov},
  journal= {arXiv preprint arXiv:math/0509620},
  year   = {2009}
}

Comments

15 pages, 2 figures; presented at 2004 Com2MaC Conference on Association Schemes, Codes and Designs; submitted to Discrete Mathematics