Quasi-Cross Lattice Tilings With Applications to Flash Memory
We consider lattice tilings of R-n by a shape we call a (k(+), k(-), n)-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes k(+) and k(-) of positive error and negative error respectively (the ratio of which, beta = k(-)/k(+), is called the balance ratio). These codes can be used to correct both disturb and retention errors in flash memories, which are characterized by having limited magnitudes and different signs. For any rational 0 < beta < 1 we construct an infinite family of (k(+), k(-), n)-quasi-cross lattice tilings with balance ratio k(-)/k(+). We also provide a specific construction for an infinite family of (2, 1, n)-quasi-cross lattice tilings. The constructions are related to group splitting and modular B-1 sequences. In addition, we study bounds on the parameters of lattice-tilings by quasi-crosses, and express them in terms of the arm lengths of the quasi-crosses and the dimension. We also prove constraints on group splitting, a specific case of which shows that the parameters of the lattice tiling by (2, 1, n)-quasi-crosses are the only ones possible for these quasi-crosses.
lattices tiling flash memory limited-magnitude errors asymmetric channel perfect codes