Compressed encoding for rank modulation

@article{Gad2011CompressedEF,
  title={Compressed encoding for rank modulation},
  author={Eyal En Gad and Anxiao Jiang and Jehoshua Bruck},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  year={2011},
  pages={884-888}
}
  • Eyal En Gad, Anxiao Jiang, Jehoshua Bruck
  • Published 2011
  • Mathematics, Computer Science
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the “push to the top” operation that is not efficient in the general case. We propose a new encoding procedure where a cell level is raised to be higher than the minimal necessary subset -instead of all - of the other cell levels. This new procedure leads to a significantly more… CONTINUE READING
    17 Citations

    Figures and Topics from this paper.

    Compressed Rank Modulation
    • Qing Li
    • Mathematics, Computer Science
    • 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
    • 2012
    • 8
    • PDF
    Rank-modulation rewriting codes for flash memories
    • 13
    • PDF
    Rank-Modulation Rewrite Coding for Flash Memories
    • 6
    • PDF
    Parallel programming of rank modulation
    • 8
    • PDF
    Rewriting Schemes for Flash Memory
    Rewritable coset coding for flash memories
    • 1
    • PDF
    Channel Coding Methods for Non-Volatile Memories
    • 13
    • PDF
    Trade-offs between instantaneous and total capacity in multi-cell flash memories
    • 20
    • PDF
    Adaptive Read Thresholds for NAND Flash
    • 21
    • PDF
    Snake-in-the-Box Codes for Rank Modulation
    • 45
    • PDF

    References

    SHOWING 1-10 OF 12 REFERENCES
    On the capacity of bounded rank modulation for flash memories
    • 25
    • PDF
    Rank modulation for flash memories
    • 247
    • PDF
    Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
    • 71
    • PDF
    Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
    • 103
    • PDF
    On a construction for constant-weight Gray codes for local rank modulation
    • 23
    • PDF
    On a construction for constant-weight Gray codes for local rank modulation
    • 5
    Constant-Weight Gray Codes for Local Rank Modulation
    • M. Schwartz
    • Computer Science, Mathematics
    • IEEE Transactions on Information Theory
    • 2011
    • 42
    • Highly Influential
    • PDF
    Rank mo dulation for flash memories,”IEEE
    • Trans. on Inform. Theory, vol. 55,
    • 2009
    Spheres of permutations under the infinity nor m – permutations with limited displacement
    • University of Bergen, Bergen, Norway, Tech. Rep. 376, Nov. 2008.
    • 2008
    Spheres of permutations under the infinity norm – permutations with limited displacement
    • University of Bergen, Bergen, Norway, Tech. Rep. 376, Nov. 2008.
    • 2008