Pages that link to "Item:Q851766"
From MaRDI portal
The following pages link to Fast decoding of quasi-perfect Lee distance codes (Q851766):
Displaying 20 items.
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles (Q723608) (← links)
- Quasi-perfect codes in the \(\ell _p\) metric (Q725704) (← links)
- Enumerating and decoding perfect linear Lee codes (Q735017) (← links)
- Perfect codes in the \(\ell_p\) metric (Q901156) (← links)
- On perfect Lee codes (Q1045037) (← links)
- Perfect codes in Euclidean lattices (Q1983871) (← links)
- On the non-existence of linear perfect Lee codes: the Zhang-Ge condition and a new polynomial criterion (Q2011142) (← links)
- Tiling \(\mathbb R^5\) by crosses (Q2250044) (← links)
- On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres (Q2424911) (← links)
- A generalization of Lee codes (Q2436575) (← links)
- On the non-existence of lattice tilings by quasi-crosses (Q2441621) (← links)
- Lattice-like total perfect codes (Q2442269) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- A new approach towards the Golomb-Welch conjecture (Q2637233) (← links)
- (Q2989858) (redirect page) (← links)
- Packing of ℝ<sup>2</sup> by Crosses (Q3465418) (← links)
- Rainbow perfect domination in lattice graphs (Q5009971) (← links)
- Perfect codes in two-dimensional algebraic lattices (Q6056444) (← links)
- On linear diameter perfect Lee codes with distance 6 (Q6071958) (← links)
- Partitions into perfect codes in the Hamming and Lee metrics (Q6173462) (← links)