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} }
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
Compressed Rank Modulation
- Mathematics, Computer Science
- 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2012
- 8
- PDF
Rank-modulation rewriting codes for flash memories
- Computer Science
- 2013 IEEE International Symposium on Information Theory
- 2013
- 13
- PDF
Rank-Modulation Rewrite Coding for Flash Memories
- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2015
- 6
- PDF
Parallel programming of rank modulation
- Mathematics, Computer Science
- 2013 IEEE International Symposium on Information Theory
- 2013
- 8
- PDF
Rewritable coset coding for flash memories
- Computer Science
- 2014 IEEE International Symposium on Information Theory
- 2014
- 1
- PDF
Channel Coding Methods for Non-Volatile Memories
- Computer Science
- Found. Trends Commun. Inf. Theory
- 2016
- 13
- PDF
Trade-offs between instantaneous and total capacity in multi-cell flash memories
- Computer Science
- 2012 IEEE International Symposium on Information Theory Proceedings
- 2012
- 20
- PDF
Snake-in-the-Box Codes for Rank Modulation
- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2012
- 48
- PDF
References
SHOWING 1-10 OF 12 REFERENCES
On the capacity of bounded rank modulation for flash memories
- Mathematics, Computer Science
- 2009 IEEE International Symposium on Information Theory
- 2009
- 25
- PDF
Rank modulation for flash memories
- Computer Science
- 2008 IEEE International Symposium on Information Theory
- 2008
- 248
- PDF
Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2010
- 72
- PDF
Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2010
- 105
- PDF
On a construction for constant-weight Gray codes for local rank modulation
- Mathematics, Computer Science
- 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel
- 2010
- 24
- PDF
Constant-Weight Gray Codes for Local Rank Modulation
- 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