Quasi-Cross Lattice Tilings With Applications to Flash Memory

DOI10.1109/TIT.2011.2176718zbMath1365.94655arXiv1102.2035OpenAlexW2150237827WikidataQ59902915 ScholiaQ59902915MaRDI QIDQ5272021

Moshe Schwartz

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.2035

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (16)

Codes of length two correcting single errors of limited size ⋮ Nonsingular splittings of cyclic groups ⋮ Codes of Length 2 Correcting Single Errors of Limited Size ⋮ Packing of ℝ² by Crosses ⋮ Linear covering codes and error-correcting codes for limited-magnitude errors ⋮ On linear diameter perfect Lee codes with distance 6 ⋮ On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres ⋮ Perfect codes in the \(\ell_p\) metric ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ A generalization of Lee codes ⋮ On the non-existence of lattice tilings by quasi-crosses ⋮ Lattice-like total perfect codes ⋮ Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses ⋮ The structure of cube tilings under symmetry conditions ⋮ On the existence of perfect splitter sets ⋮ On tilings of asymmetric limited-magnitude balls

This page was built for publication: Quasi-Cross Lattice Tilings With Applications to Flash Memory