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

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.