By Topic

Tilings With n -Dimensional Chairs and Their Applications to Asymmetric Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sarit Buzaglo ; Department of Computer Science, Technion—Israel Institute of Technology, Haifa, Israel ; Tuvi Etzion

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 some memories using asymmetric codes. The first one is in the design of codes that 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.

Published in:

IEEE Transactions on Information Theory  (Volume:59 ,  Issue: 3 )