DocumentCode :
936529
Title :
Perfect codes hardly exist
Author :
Best, Marc R.
Volume :
29
Issue :
3
fYear :
1983
fDate :
5/1/1983 12:00:00 AM
Firstpage :
349
Lastpage :
351
Abstract :
The main lines of a partial proof of the "perfect code theorem" are presented. The relevant part refers to the nonexistence of unknown 
-perfect codes over arbitrary alphabets for 
. The details of the proof can be found in the author\´s Ph.D. dissertation at the University of Amsterdam.
-perfect codes over arbitrary alphabets for . The details of the proof can be found in the author\´s Ph.D. dissertation at the University of Amsterdam.Keywords :
Error-correction coding; Binary codes; Error correction codes; Information theory; Linear code; Polynomials; Retirement; Solids;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056677
Filename :
1056677
Link To Document :
