Enumerating and decoding perfect linear Lee codes
From MaRDI portal
Recommendations
- On perfect Lee codes
- On the complete decoding of binary linear codes (Corresp.)
- A class of linear codes and their complete weight enumerators
- scientific article; zbMATH DE number 1047011
- A construction of linear codes and their complete weight enumerators
- Complete weight enumerators of a class of linear codes
- Complete weight enumerators of a class of linear codes
- Perfect codes with respect to Lee metric
- Perfect binary codes: constructions, properties, and enumeration
- On some perfect codes with respect to Lee metric
Cites work
- scientific article; zbMATH DE number 3625286 (Why is no real title available?)
- scientific article; zbMATH DE number 1885945 (Why is no real title available?)
- scientific article; zbMATH DE number 3405969 (Why is no real title available?)
- On mosaics consisting of multidimensional crosses
- On the non-existence of 3-dimensional tiling in the Lee metric
- Quasi-perfect Lee distance codes
- Tilings in Lee metric
Cited in
(10)- Constructions and invariants of optimal codes in the Lee metric
- Quasi-perfect Lee distance codes
- scientific article; zbMATH DE number 1455270 (Why is no real title available?)
- A new approach towards the Golomb-Welch conjecture
- scientific article; zbMATH DE number 2077083 (Why is no real title available?)
- On regular sets in Cayley graphs
- Perfect codes in the discrete simplex
- Partitions into perfect codes in the Hamming and Lee metrics
- Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses
- Tiling \(\mathbb R^5\) by crosses
This page was built for publication: Enumerating and decoding perfect linear Lee codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735017)
