Local Rank Modulation for Flash Memories
Michal Horovitz, Tuvi Etzion · IEEE Transactions on Information Theory · 2014
Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For 03, 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.