Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme

DOI10.1109/TIT.2010.2046241MaRDI QIDQ5281432zbMATH OpenWikidataFDO

Authors Itzhak Tamo, Moshe Schwartz

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Combinatorial codes (94B25) Mathematical problems of computer architecture (68M07) Burst-correcting codes (94B20) Modulation and demodulation in information and communication theory (94A14)

Abstract: We study error-correcting codes for permutations under the infinity norm, motivated by a novel storage scheme for flash memories call rank modulation. In this scheme, a set of $n$ flash cells are combined to create a single virtual multi-level cell. Information is stored in the permutation induced by the cell charge levels. Spike errors, which are characterized by a limited-magnitude change in cell charge levels, correspond to a low-distance change under the infinity norm. We define codes protecting against spike errors, called limited-magnitude rank-modulation codes (LMRM codes), and present several constructions for these codes, some resulting in optimal codes. These codes admit simple recursive, and sometimes direct, encoding and decoding procedures. We also provide lower and upper bounds on the maximal size of LMRM codes both in the general case, and in the case where the codes form a subgroup of the symmetric group. In the asymptotic analysis, the codes we construct out-perform the Gilbert-Varshamov-like bound estimate.

Cited in

(13)

• Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
• Computing the ball size of frequency permutations under Chebyshev distance
• Constructions and invariants of optimal codes in the Lee metric
• Coding for locality in reconstructing permutations
• scientific article; zbMATH DE number 7790332 (Why is no real title available?)
• Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
• Covering radius of permutation groups with infinity-norm
• Increasing the minimum distance of codes by twisting
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Lower bounds on the size of spheres of permutations under the Chebychev distance
• Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
• Error-correcting codes from \(k\)-resolving sets

This page was built for publication: Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme

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