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

DOI10.1109/TIT.1982.1056443zbMath0481.94011MaRDI QIDQ3939720

Jaakko T. Astola

Publication date: 1982

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

modification for the Elias bound in the Lee metricnonexistence theorem for perfect Lee codes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Fast decoding of quasi-perfect Lee distance codes ⋮ Nonexistence of face-to-face four-dimensional tilings in the Lee metric ⋮ On bounds for codes over Frobenius rings under homogeneous weights ⋮ New upper bounds on Lee codes ⋮ On the asymptotic behaviour of Lee-codes

This page was built for publication: An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)