Quasi-Cross Lattice Tilings with Applications to Flash Memory

Details Quasi-Cross Lattice Tilings with Applications to Flash Memory Quasi-Cross Lattice Tilings with Applications to Flash Memory

2011-02-10

arxiv.org/abs/1102.2035v1

Computer Science

Information Theory

Scientific paper

We consider lattice tilings of $\R^n$ by a shape we call a $(\kp,\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and negative error (the ratio of which 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. We construct infinite families of perfect codes for any rational balance ratio, and provide a specific construction for $(2,1,n)$-quasi-cross lattice tiling. The constructions are related to group splitting and modular $B_1$ sequences. We also study bounds on the parameters of lattice-tilings by quasi-crosses, connecting 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 of $(2,1,n)$-quasi-crosses is the only ones possible.

Affiliated with

Also associated with

No associations

Rating

Quasi-Cross Lattice Tilings with Applications to Flash Memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quasi-Cross Lattice Tilings with Applications to Flash Memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-Cross Lattice Tilings with Applications to Flash Memory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694049