Author_Institution :
Electr. & Comput. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
Abstract :
We study necessary conditions for the existence of lattice tilings of Rn by quasi-crosses. We prove general non-existence results using a variety of number-theoretic tools. We then apply these results to the two smallest unclassified shapes, the (3, 1, n)-quasi-cross and the (3, 2, n)-quasi-cross. We show that for dimensions n ≤ 250, apart from the known constructions, there are no lattice tilings of Rn by (3, 1, n)-quasi-crosses except for ten remaining unresolved cases, and no lattice tilings of Rn by (3, 2, n)-quasi-crosses except for eleven remaining unresolved cases.
Keywords :
error correction codes; flash memories; linear codes; number theory; flash memory cells; floating gate technology; lattice tiling existence; necessary condition; nonexistence result; number-theoretic tools; perfect linear 1-error-correcting codes; quasicross; smallest unclassified shape; unbalanced limited-magnitude error model; Ash; Computers; Educational institutions; Lattices; Shape; Vectors; Zinc;