By Topic

Perfect codes hardly exist

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The main lines of a partial proof of the "perfect code theorem" are presented. The relevant part refers to the nonexistence of unknown t -perfect codes over arbitrary alphabets for t \not \in {1, 2, 6, 8} . The details of the proof can be found in the author's Ph.D. dissertation at the University of Amsterdam.

Published in:

IEEE Transactions on Information Theory  (Volume:29 ,  Issue: 3 )