On Perfect Codes in the Johnson Graph
classification
💻 cs.IT
math.IT
keywords
codesperfectexistencegraphjohnsoncombinatorialconditionsconsider
read the original abstract
In this paper we consider the existence of nontrivial perfect codes in the Johnson graph J(n,w). We present combinatorial and number theory techniques to provide necessary conditions for existence of such codes and reduce the range of parameters in which 1-perfect and 2-perfect codes may exist.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.