On the non-existence of lattice tilings by quasi-crosses
From MaRDI portal
Publication:2441621
DOI10.1016/j.ejc.2013.05.031zbMath1284.05056arXiv1211.0658OpenAlexW1993216293WikidataQ59902837 ScholiaQ59902837MaRDI QIDQ2441621
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0658
Related Items (6)
Nonsingular splittings of cyclic groups ⋮ Linear covering codes and error-correcting codes for limited-magnitude errors ⋮ Perfect codes in the \(\ell_p\) metric ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ On the existence of perfect splitter sets ⋮ On tilings of asymmetric limited-magnitude balls
Cites Work
- Unnamed Item
- Unnamed Item
- Abelian groups and packing by semicrosses
- Fast decoding of quasi-perfect Lee distance codes
- Tilings in Lee metric
- On perfect Lee codes
- Factoring by subsets
- Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes
- Packings of<tex>R^n</tex>by certain error spheres
- Combinatorial packings of<tex>R^3</tex>by certain error spheres
- Nonexistence theorems on perfect Lee codes over large alphabets
- Splittings of cyclic groups and perfect shift codes
- Splitting Groups by Integers
- Codes Correcting Single Errors of Limited Magnitude
- Quasi-Cross Lattice Tilings With Applications to Flash Memory
- Product Constructions for Perfect Lee Codes
- Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories
- Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
- Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
This page was built for publication: On the non-existence of lattice tilings by quasi-crosses
