On the asymptotic behaviour of Lee-codes

DOI10.1016/0166-218X(84)90074-XzbMATH Open0538.94019MaRDI QIDQ793695FDOQ793695

Authors: Jaakko Astola 

Publication date: 1984

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

Recommendations

• scientific article; zbMATH DE number 774615
• Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
• Asymptotic bounds on the covering radius of binary codes
• On maximum Lee distance codes
• Bounds in the Lee metric and optimal codes

zbMATH Keywords

boundscovering radiusinformation rateVarshamov-Gilbert boundLee-codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

Cited In (13)

• Asymptotic behaviors of population codes
• Lower bounds on the minimum distance of long codes in the Lee metric
• Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
• Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
• Fast decoding of quasi-perfect Lee distance codes
• On bounds for codes over Frobenius rings under homogeneous weights
• On the hardness of the Lee syndrome decoding problem
• Information set decoding for Lee-metric codes using restricted balls
• New upper bounds on Lee codes
• Title not available (Why is that?)
• \textsf{FuLeeca}: a Lee-based signature scheme
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• Nonexistence of face-to-face four-dimensional tilings in the Lee metric

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

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