Enumerating and decoding perfect linear Lee codes
From MaRDI portal
Publication:735017
DOI10.1007/S10623-009-9273-3zbMATH Open1174.94030OpenAlexW1990315714MaRDI QIDQ735017FDOQ735017
Lorenzo Milazzo, Peter Horák, Bader F. AlBdaiwi
Publication date: 14 October 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9273-3
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
- Tilings in Lee metric
- On the non-existence of 3-dimensional tiling in the Lee metric
- On mosaics consisting of multidimensional crosses
- Title not available (Why is that?)
- Quasi-perfect Lee distance codes
- Fast decoding of quasi-perfect Lee distance codes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Perfect codes in the discrete simplex
- Partitions into perfect codes in the Hamming and Lee metrics
- Quasi-perfect Lee distance codes
- Constructions and invariants of optimal codes in the Lee metric
- Tiling \(\mathbb R^5\) by crosses
- Fast decoding of quasi-perfect Lee distance codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- On regular sets in Cayley graphs
- A new approach towards the Golomb-Welch conjecture
- Non-periodic tilings of \({\mathbb{R}}^{n}\) 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)
