On the asymptotic behaviour of Lee-codes
From MaRDI portal
Publication:793695
Recommendations
Cites work
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- 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
(12)- On bounds for codes over Frobenius rings under homogeneous weights
- Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
- scientific article; zbMATH DE number 910958 (Why is no real title available?)
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- \textsf{FuLeeca}: a Lee-based signature scheme
- New upper bounds on Lee codes
- On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
- On the hardness of the Lee syndrome decoding problem
- Asymptotic behaviors of population codes
- Lower bounds on the minimum distance of long codes in the Lee metric
- Information set decoding for Lee-metric codes using restricted balls
- 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)
