Local Rank Modulation for Flash Memories

DOI10.1109/TIT.2018.2859403MaRDI QIDQ4629928zbMATH OpenOpenAlexWikidataFDO

Authors Michal Horovitz, Tuvi Etzion

Publication date 28 March 2019

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

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

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For $0<sleqtleqn$ with $s$ divides $n$, an $(s,t,n)$-LRM scheme is a local rank modulation scheme where the $n$ cells are locally viewed cyclically through a sliding window of size $t$ resulting in a sequence of small permutations which requires less comparisons and less distinct values. The gap between two such windows equals to $s$. In this work, encoding, decoding, and asymptotic enumeration of the $(1,3,n)$-LRM scheme is studied. The techniques which are suggested have some generalizations for $(1,t,n)$-LRM, $t>3$, but the proofs will become more complicated. The enumeration problem is presented also as a purely combinatorial problem. Finally, we prove the conjecture that the size of a constant weight $(1,2,n)$-LRM Gray code with weight two is at most $2n$.

This page was built for publication: Local Rank Modulation for Flash Memories

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