On the asymptotic behaviour of Lee-codes

DOI10.1016/0166-218X(84)90074-XzbMath0538.94019MaRDI QIDQ793695

Jaakko T. Astola

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering radiusboundsinformation rateVarshamov-Gilbert boundLee-codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (7)

Fast decoding of quasi-perfect Lee distance codes ⋮ Nonexistence of face-to-face four-dimensional tilings in the Lee metric ⋮ On the hardness of the Lee syndrome decoding problem ⋮ Information set decoding for Lee-metric codes using restricted balls ⋮ Lower bounds on the minimum distance of long codes in the Lee metric ⋮ On bounds for codes over Frobenius rings under homogeneous weights ⋮ Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)
• On channels and codes for the Lee metric

This page was built for publication: On the asymptotic behaviour of Lee-codes