Time-space constrained codes for phase-change memories

IEEE Transactions on Information Theory

Volumn 59, Issue 8, 2013, Pages 5102-5114

  Qin, Minghai ^a   Yaakobi, Eitan ^b,c   Siegel, Paul H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b California Institute of Technology   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Constrained codes; phase change memory; write once memory codes

Indexed keywords

CONSTRAINED CODES; CRYSTALLINE STATE; GENERAL UPPER BOUND; HIGH TEMPERATURE; MEMORY CODES; NON-VOLATILE; PHASE CHANGE MEMORY (PCM); SOLID-STATE MEMORY;

CELLS; CRYSTALLINE MATERIALS; HAMMING DISTANCE; PHASE CHANGE MEMORY;

CYTOLOGY;

EID: 84880557046     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2257916     Document Type: Article

References (30)

1. R. Ahlswede and Z. Zhang, "Coding for write-efficient memory," Inf. Comput., vol. 83, no. 1, pp. 80-97, Oct. 1989. (Pubitemid 20608735)
2. N. Alon and J. Spencer, The Probabilistic Method. NewYork,NY, USA: Wiley, 1992.
3. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ, USA: Prentice-Hall, 1971.
4. G. Burr, M. Breitwisch, M. Franceschini, D. Garetto, K. Gopalakrishnan, B. Jackson, B. Kurdi, C. Lam, L. Lastras-Montaño, A. Padilla, B. Rajendran, S. Raoux, and R. Shenoy, "Phase change memory technology," J. Vac. Sci. Technol., vol. 28, no. 2, pp. 223-262, Mar. 2010.
5. G. D. Cohen, "A nonconstructive upper bound on covering radius," IEEE Trans. Inf. Theory, vol. 29, no. 3, pp. 352-353, May 1983.
6. G. D. Cohen and G. Zemor, "Write-isolated memories (WIMs)," Discrete Mathematics, vol. 114, no. 1-3, pp. 105-113, Apr. 1983.
7. T. Cover, "Enumerative source encoding," IEEE Trans. Inf. Theory, vol. 19, no. 1, pp. 73-77, Jan. 1973.
8. S. Datta and S. W. McLaughlin, "An enumerative method for runlength-limited codes: Permutation codes," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2199-2204, Sep. 1999. (Pubitemid 32077657)
9. S. Datta and S. W. McLaughlin, "Optimal block codes for-ary runlength-constrained channels," IEEE Trans. Inf. Theory, vol. 47, no. 5, pp. 2069-2078, Jul. 2001.
10. A. El Gamal and Y.-H. Kim, Network Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 2011.
11. S. Forchhammer and T. V. Laursen, "A model for the two-dimensional no isolated bits constraint," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, USA, Jul. 2006, pp. 1189-1193. (Pubitemid 351244284)
12. F. Freitas and W. Wickle, "Storage-class memory: The next storage system technology," IBM J. Res. Dev., vol. 52, no. 4, pp. 439-447, 2008.
13. S. Halevy, J. Chen, R. M. Roth, P. H. Siegel, and J. K.Wolf, "Improved bit-stuffing bounds on two-dimensional constraints," IEEE Trans. Inf. Theory, vol. 50, no. 5, pp. 824-838, May 2004.
14. C. Heegard, "On the capacity of permanent memory," IEEE Trans. Inf. Theory, vol. 31, no. 1, pp. 34-42, Jan. 1985.
15. C. Heegard and A. El Gamal, "On the capacity of computer memory with defects," IEEE Trans. Inf. Theory, vol. 29, no. 5, pp. 731-739, Sep. 1983.
16. K. S. Immink, P. H. Siegel, and J. K. Wolf, "Codes for digital recorders," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2260-2299, Oct. 1998. (Pubitemid 128741891)
17. A. Jiang, J. Bruck, and H. Li, "Constrained codes for phase-change memories," in Proc. IEEE Inf. TheoryWorkshop, Dublin, Ireland, Aug.-Sep. 2010.
18. A. Kato and K. Zeger, "On the capacity of two-dimensional run-length constrained channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1527-1540, Jul. 1999.
19. L. Lastras-Montaño, M. Franceschini, T. Mittelholzer, J. Karidis, and M. Wegman, "On the lifetime of multilevel memories," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jul. 2009, pp. 1224-1228.
20. B. H. Marcus, R.M. Roth, and P. H. Siegel, "Constrained Systems and Coding for Recording Channels," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. New York, NY, USA: Elsevier, 1998, ch. 20.
21. J. Moon and B. Brickner, "Maximum transition run codes for data storage systems," IEEE Trans. Magn., vol. 32, no. 5, pp. 3992-3994, Sep. 1996. (Pubitemid 126772581)
22. Z. Nagy and K. Zeger, "Asymptotic capacity of two-dimensional channels with checkerboard constraints," IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2115-2125, Sep. 2003.
23. A. Pirovano, A. Redaelli, F. Pellizzer, F. Ottogalli,M. Tosi, D. Ielmini, A. Lacaita, and R. Bez, "Reliability study of phase-change nonvolatile memories," IEEE Trans. DeviceMater. Rel., vol. 4, no. 3, pp. 422-427, Sep. 2004.
24. R. Rivest and A. Shamir, "How to reuse a write-once memory," Inf. Control, vol. 55, no. 1-3, pp. 1-19, Dec. 1982.
25. R. E. Swanson and J. K. Wolf, "A new class of two-dimensional RLL recording codes," IEEE Trans. Magn., vol. 28, no. 6, pp. 3407-3416, Nov. 1992.
26. I. Tal and R. M. Roth, "Convex programming upper bounds on the capacity of 2-D constraints," IEEE Trans. Inf. Theory, vol. 57, no. 1, pp. 381-391, Jan. 2011.
27. W. Weeks and R. Blahut, "The capacity and coding gain of certain checkerboard codes," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 1193-1203, May 1998. (Pubitemid 128743278)
28. E. Yaakobi, S. Kayser, P. H. Siegel, A. Vardy, and J. K. Wolf, "Codes for write-once memories," IEEE Trans. Inf. Theory, vol. 58, no. 9, pp. 5985-5999, Sep. 2012.
29. E. Yaakobi, S. Kayser, P. H. Siegel, A. Vardy, and J. K.Wolf, "Efficient two-writeWOM-codes," in Proc. IEEE Inf. Theory Workshop, Dublin, Ireland, Aug.-Sep. 2010.
30. E. Zehavi and J. K. Wolf, "On runlength codes," IEEE Trans. Inf. Theory, vol. 34, no. 1, pp. 45-54, Jan. 1988.