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

DOI10.1109/TIT.2012.2226925MaRDI QIDQ2989367zbMATH OpenFDO

Authors Sarit Buzaglo, Tuvi Etzion

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Other types of codes (94B60)

Abstract: 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.

Cited in

(5)

• On tilings of asymmetric limited-magnitude balls
• On the existence of perfect splitter sets
• On the non-existence of lattice tilings by quasi-crosses
• Short k‐radius sequences, k‐difference sequences and universal cycles
• Nonsingular splittings of cyclic groups

This page was built for publication: Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989367)