On Perfect Codes in the Johnson Graph

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-284530

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.