On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion
From MaRDI portal
Publication:2011142
DOI10.1016/j.ejc.2019.103022zbMath1472.94084arXiv1805.10409OpenAlexW2974730043MaRDI QIDQ2011142
Publication date: 28 November 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.10409
Related Items (2)
On linear diameter perfect Lee codes with distance 6 ⋮ No lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast decoding of quasi-perfect Lee distance codes
- Nonexistence of face-to-face four-dimensional tilings in the Lee metric
- Perfect codes in the \(\ell_p\) metric
- Lucas' theorem for prime powers
- Tilings in Lee metric
- On perfect Lee codes
- On the non-existence of 3-dimensional tiling in the Lee metric
- Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions
- A new approach towards the Golomb-Welch conjecture
- A modification of the elias-bound and nonexistence theorems for perfect codes in the Lee-metric
- Nonexistence theorems on perfect Lee codes over large alphabets
- 50 Years of the Golomb--Welch Conjecture
- Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
This page was built for publication: On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion
