On linear diameter perfect Lee codes with distance 6
From MaRDI portal
(Redirected from On linear diameter perfect Lee codes with distance 6)
Recommendations
Cites work
- 50 Years of the Golomb--Welch Conjecture
- A modification of the elias-bound and nonexistence theorems for perfect codes in the Lee-metric
- A survey of partial difference sets
- Characters and cyclotomic fields in finite geometry
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Error-Correction of Multidimensional Bursts
- Factoring groups into subsets.
- Finite geometry and character theory
- scientific article; zbMATH DE number 1943109 (Why is no real title available?)
- Interleaving schemes for multidimensional cluster errors
- Lectures on advances in combinatorics
- Lee-metric BCH codes and their application to constrained and partial-response channels
- No lattice tiling of \(\mathbb{Z}^n\) by Lee sphere of radius 2
- Non-Binary Error Correction Codes*
- Nonexistence of face-to-face four-dimensional tilings in the Lee metric
- Nonexistence of perfect 2-error-correcting Lee codes in certain dimensions
- Nonexistence theorems on perfect Lee codes over large alphabets
- On perfect codes and related concepts
- On perfect Lee codes
- On the non-existence of 3-dimensional tiling in the Lee metric
- On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion
- On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres
- Partial difference sets
- Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric
- Perfect codes and related structures
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
- Product Constructions for Perfect Lee Codes
- Quasi-Cross Lattice Tilings With Applications to Flash Memory
- Tilings in Lee metric
This page was built for publication: On linear diameter perfect Lee codes with distance 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071958)