Computer Science – Information Theory
Scientific paper
2010-04-29
Computer Science
Information Theory
Submitted for ACCT 2010
Scientific paper
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.
Etzion Tuvi
Silberstein Natalia
No associations
LandOfFree
On Perfect Codes in the Johnson Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Perfect Codes in the Johnson Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Perfect Codes in the Johnson Graph will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-284530