Rank-modulation rewriting codes for flash memories

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 704-708

  Gad, Eyal En ^a   Yaakobi, Eitan ^a   Jiang, Anxiao Andrew ^b   Bruck, Jehoshua ^a  

^a California Institute of Technology   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSUMER DEVICES; COST MINIMIZATION; EFFICIENT ENCODING; FLASH DEVICES; MEMORY TECHNOLOGY; RANK MODULATIONS; RELATIVE VALUE; STORAGE SYSTEMS;

INFORMATION THEORY; MODULATION;

FLASH MEMORY;

EID: 84890383536     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620317     Document Type: Conference Paper

References (22)

1. E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," IEEE Trans. on Inform. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
2. A. Barg and A. Mazumdar, "Codes in permutations and error correction for rank modulation," IEEE Trans. on Inform. Theory, vol. 56, no. 7, pp. 3158-3165, Jul. 2010.
3. D. Burshtein and A. Strugatski, "Polar write once memory codes," in Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT2012, Cambridge, MA, USA, Jul. 2012, pp. 1982-1986.
4. E. En Gad, A. Jiang, and J. Bruck, "Compressed encoding for rank modulation," in Proceedings of the 2011 IEEE Int. Symp. on Inform. Theory, ISIT2011, St. Petersburg, Russia, Aug. 2011, pp. 884-888.
5. -, "Trade-offs between instantaneous and total capacity in multi-cell flash memories," in Proceedings of the 2012 IEEE Int. Symp. on Inform. Theory, ISIT2012, Cambridge, Massachusetts, Jul. 2012, pp. 990-994.
6. E. En Gad, M. Langberg, M. Schwartz, and J. Bruck, "Constant-weight gray codes for local rank modulation," IEEE Trans. on Inform. Theory, vol. 57, no. 11, pp. 7431-7442, Nov. 2011.
7. F. Farnoud, V. Skachek, and O. Milenkovic, "Rank modulation for translocation correction," in Proceedings of the IEEE International Symp. on Inform. Theory (ISIT), Jun. 2012, pp. 2988-2992.
8. F.-W. Fu and A. J. Han Vinck, "On the capacity of generalized writeonce memory with state transitions described by an arbitrary directed acyclic graph," IEEE Trans. on Inform. Theory, vol. 45, no. 1, pp. 308-313, Jan. 1999.
9. V. Guruswami and P. Xia, "Polar codes: Speed of polarization and polynomial gap to capacity," Electronic Colloquium on Computational Complexity, Tech. Rep. 50, Apr. 2013. [Online]. Available: http://eccc.hpi-web. de/report/2013/050/
10. S. H. Hassani, K. Alishahi, and R. Urbanke, "Finitelength scaling of polar codes," Apr. 2013. [Online]. Available: http://arxiv.org/abs/1304. 4778
11. A. Jiang, Y. Li, E. En Gad, M. Langberg, and J. Bruck, "Joint rewriting and error correction in write-once memories," in Submitted to ISIT 2013.
12. A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck, "Rank modulation for flash memories," IEEE Trans. on Inform. Theory, vol. 55, no. 6, pp. 2659-2673, Jun. 2009.
13. A. Jiang, M. Schwartz, and J. Bruck, "Correcting charge-constrained errors in the rank-modulation scheme," IEEE Trans. on Inform. Theory, vol. 56, no. 5, pp. 2112-2120, May 2010.
14. M. Kim, J. K. Park, and C. Twigg, "Rank modulation hardware for flash memories," in Circuits and Systems (MWSCAS), 2012 IEEE 55th International Midwest Symposium on, aug. 2012, pp. 294-297.
15. D. E. Knuth, "Efficient balanced codes," IEEE Trans. on Inform. Theory, vol. 32, no. 1, pp. 51-53, 1986.
16. -, The Art of Computer Programming Volume 4, Fascicle 3. Addison Wesley, 2005.
17. S. B. Korada and R. Urbanke, "Polar codes are optimal for lossy source coding," IEEE Trans. on Inform. Theory, vol. 56, no. 4, pp. 1751-1768, Apr. 2010.
18. Q. Li, "Compressed rank modulation," in Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on, 2012, pp. 185-192.
19. N. Papandreou, H. Pozidis, T. Mittelholzer, G. F. Close, M. Breitwisch, C. Lam, and E. Eleftheriou, "Drift-tolerant multilevel phase-change memory," in Memory Workshop (IMW), 2011 3rd IEEE International, 2011, pp. 1-4.
20. A. Shpilka, "Capacity achieving multiwrite wom codes," in Submitted to ISIT 2013.
21. I. Tamo and M. Schwartz, "Correcting limited-magnitude errors in the rank-modulation scheme," IEEE Trans. on Inform. Theory, vol. 56, no. 6, pp. 2551-2560, Jun. 2010.
22. Z. Wang and J. Bruck, "Partial rank modulation for flash memories," in Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT2010), Austin, TX, U.S.A., Jun. 2010, pp. 864-868.