By Topic

An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)

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
$31 $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 classical Elias bound for the Lee metric is weak when the size of the alphabet is larger than the minimum distance. A modified upper bound which is also strong for large alphabets is derived. This bound then is used to prove a nonexistence theorem for perfect Lee codes over large alphabets.

Published in:

Information Theory, IEEE Transactions on  (Volume:28 ,  Issue: 1 )