Abstract
Let exp p ( q ) denote the number of times the prime number p appears in the prime factorization of the integer q . The following result is proved: If there is a perfect 1-error correcting code of length n over an alphabet with q symbols then, for every prime number p , exp p ( 1 + n ( q − 1 ) ) ≤ exp p ( q ) ( 1 + ( n − 1 ) / q ) . This condition is stronger than both the packing condition and the necessary condition given by the Lloyd theorem, as it for example excludes the existence of a perfect code with the parameters ( n , q , e ) = ( 19 , 6 , 1 ) .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
