Generalized Gray Codes for Local Rank Modulation

DOI10.1109/TIT.2013.2268534MaRDI QIDQ5346314zbMATH OpenWikidataFDO

Authors Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck

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/1103.0317

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14)

Abstract: We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rank-modulation is a generalization of the rank-modulation scheme, which has been recently suggested as a way of storing information in flash memory. We study Gray codes for the local rank-modulation scheme in order to simulate conventional multi-level flash cells while retaining the benefits of rank modulation. Unlike the limited scope of previous works, we consider code constructions for the entire range of parameters including the code length, sliding window size, and overlap between adjacent windows. We show our constructed codes have asymptotically-optimal rate. We also provide efficient encoding, decoding, and next-state algorithms.

Cited in

(3)

• Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
• Capacity and Codes for Embedding Information in Gray-Scale Signals
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric

This page was built for publication: Generalized Gray Codes for Local Rank Modulation

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