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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.