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

DOI10.1109/TIT.1982.1056443MaRDI QIDQ3939720zbMATH OpenFDO

Authors Jaakko 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)

Cited in

(4)

• On bounds for codes over Frobenius rings under homogeneous weights
• New upper bounds on Lee codes
• On the asymptotic behaviour of Lee-codes
• Nonexistence of face-to-face four-dimensional tilings in the Lee metric

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939720)