On Perfect Codes in the Johnson Graph
Information Theory
2010-04-30 v1 math.IT
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.
Keywords
Cite
@article{arxiv.1004.5195,
title = {On Perfect Codes in the Johnson Graph},
author = {Natalia Silberstein and Tuvi Etzion},
journal= {arXiv preprint arXiv:1004.5195},
year = {2010}
}
Comments
Submitted for ACCT 2010