DocumentCode :
1968828
Title :
On the non-existence of lattice tilings by quasi-crosses
Author :
Schwartz, M.
Author_Institution :
Electr. & Comput. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
fYear :
2013
fDate :
10-15 Feb. 2013
Firstpage :
1
Lastpage :
2
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;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Applications Workshop (ITA), 2013
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-4648-1
Type :
conf
DOI :
10.1109/ITA.2013.6502976
Filename :
6502976
Link To Document :
بازگشت