Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes

Details Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes

2012-04-18

arxiv.org/abs/1204.4204v1

Computer Science

Information Theory

Scientific paper

An $n$-dimensional chair consists of an $n$-dimensional box from which a smaller $n$-dimensional box is removed. A tiling of an $n$-dimensional chair has two nice applications in coding for write-once memories. The first one is in the design of codes which correct asymmetric errors with limited-magnitude. The second one is in the design of $n$ cells $q$-ary write-once memory codes. We show an equivalence between the design of a tiling with an integer lattice and the design of a tiling from a generalization of splitting (or of Sidon sequences). A tiling of an $n$-dimensional chair can define a perfect code for correcting asymmetric errors with limited-magnitude. We present constructions for such tilings and prove cases where perfect codes for these type of errors do not exist.

Affiliated with

Also associated with

No associations

Rating

Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes 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 Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33223