Perfect binary (n, 3) codes: the structure of graphs of minimum distances

Sergey V. Avgustinovich. Perfect binary (n, 3) codes: the structure of graphs of minimum distances. Discrete Applied Mathematics, 114(1-3):9-11, 2001.

@article{Avgustinovich01,
  title = {Perfect binary (n, 3) codes: the structure of graphs of minimum distances},
  author = {Sergey V. Avgustinovich},
  year = {2001},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Avgustinovich01},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {114},
  number = {1-3},
  pages = {9-11},
}