Codes for write-once memories

IEEE Transactions on Information Theory

Volumn 58, Issue 9, 2012, Pages 5985-5999

  Yaakobi, Eitan ^a,b   Kayser, Scott ^b   Siegel, Paul H ^b   Vardy, Alexander ^b   Wolf, Jack Keil ^b  

^a California Institute of Technology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Coding theory; flash memories; WOM codes; write once memories (WOMs)

Indexed keywords

CODING SCHEME; CODING THEORY; LINEAR CODES; Q-VALUES; RECURSIVE METHODS; SUM-RATE; VARIABLE RATE; WOM-CODES; WRITE ONCE;

CELLS; COMPUTER PROGRAMMING; FLASH MEMORY; VIRTUAL STORAGE;

CYTOLOGY;

EID: 84865396281     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2200291     Document Type: Conference Paper

References (35)

1. D. Blackwell, Statistics 262. Berkeley: Course taught at the University of California, Spring, 1963.
2. T. Berger, F. Jelinek, and J. K. Wolf, "Permutation codes for sources," IEEE Trans. Inf. Theory, vol. IT-18, no. 1, pp. 160-168, Jan. 1972.
3. V. Bohossian, A. Jiang, and J. Bruck, "Buffer coding for asymmetric multilevel memory," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 2007, pp. 1186-1190.
4. R. Brent, S. Gao, and A. Lauder, "Random Krylov spaces over finite fields," SIAM J. Discrete Math, vol. 16, no. 2, pp. 276-287, Feb. 2003.
5. P. Cappelletti, C. Golla, P. Olivo, and E. Zanoni, Flash Memories. Boston, MA: Kluwer, 1999.
6. G. D. Cohen, P. Godlewski, and F. Merkx, "Linear binary code for write-once memories," IEEE Trans. Inf. Theory, vol. IT-32, no. 5, pp. 697-700, Oct. 1986. (Pubitemid 17468633)
7. J. H. Conway and N. J. Sloane, "Orbit and coset analysis of the Golay and related codes," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1038-1050, Sep. 1990. (Pubitemid 20738363)
8. T. M. Cover, "Enumerative source encoding," IEEE Trans. Inf. Theory, vol. IT-19, no. 1, pp. 73-77, Jan. 1973.
9. A. Fiat and A. Shamir, "Generalized "write-once" memories," IEEE Trans. Inf. Theory, vol. IT-30, no. 3, pp. 470-480, Sep. 1984.
10. F. Fu and A. J. H. Vinck, "On the capacity of generalized writeonce memory with state transitions described by an arbitrary directed acyclic graph," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 308-313, Sep. 1999.
11. E. Gal and S. Toledo, "Algorithms and data structures for flash memories," ACM Comput. Surv. , vol. 37, pp. 138-163, Jun. 2005. (Pubitemid 41527575)
12. S. I. Gel'fand, "Capacity of one broadcast channel," Problemy Peredachi Informatsii, vol. 13, no. 3, pp. 106-108, 1977.
13. P. Godlewski, "WOM-codes construits à partir des codes de Hamming," Discrete Math. , vol. 65, no. 3, pp. 237-243, Jul. 1987.
14. L. Grupp, A. Caulfield, J. Coburn, S. Swanson, E. Yaakobi, P. H. Siegel, and J. K. Wolf, "Characterizing flash memory: Anomalies, observations, and applications," in Proc. 42nd Annu. IEEE/ACM Int. Symp. Microarchit. , Dec. 2009, pp. 24-33.
15. C. Heegard, "On the capacity of permanent memory," IEEE Trans. Inf. Theory, vol. IT-31, no. 1, pp. 34-42, Jan. 1985.
16. A. Jiang, "On the generalization of error-correcting WOM codes," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 2007, pp. 1391-1395.
17. A. Jiang, V. Bohossian, and J. Bruck, "Floating codes for joint information storage in write asymmetric memories," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 2007, pp. 1166-1170.
18. A. Jiang and J. Bruck, "Joint coding for flash memory storage," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 2008, pp. 1741-1745.
19. S. Kayser, E. Yaakobi, P. H. Siegel, A. Vardy, and J. K. Wolf, "Multiple-write WOM-codes," presented at the presented at the 48th Annu. Allerton Conf. Commun. , Control Comput. , Monticello, IL, Sep. 2010.
20. D. E. Knuth, "Efficient balanced codes," IEEE Trans. Inf. Theory, vol. IT-32, no. 1, pp. 51-53, Jan. 1986.
21. H. Mahdavifar, P. H. Siegel, A. Vardy, J. K. Wolf, and E. Yaakobi, "A nearly optimal construction of flash codes," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jul. 2009, pp. 1239-1243.
22. F. Merkx, "Womcodes constructed with projective geometries," Traitement Du Signal, vol. 1, no. 2-2, pp. 227-231, 1984.
23. R. L. Rivest and A. Shamir, "How to reuse a write-once memory," Inf. Control, vol. 55, no. 1-3, pp. 1-19, Dec. 1982.
24. R. M. Roth, Private Communication 2010.
25. R. M. Roth, Introduction to Coding Theory. Cambridge, U. K. : Cambridge Univ. Press, 2005.
26. J. P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inf. Theory, vol. IT-18, no. 3, pp. 395-399, May 1972.
27. C. Tian, V. A. Vaishampayan, and N. J. A. Sloane, "Constant weight codes: A geometric approach based on dissections," CiteSeerX - Sci. Literature Digital Library Search Engine, 2010.
28. J. K. Wolf, A. D. Wyner, J. Ziv, and J. Korner, "Coding for a write-once memory," AT&T Bell Labs. Tech. J. , vol. 63, no. 6, pp. 1089-1112, 1984.
29. Y. Wu, "Low complexity codes for writing write-once memory twice," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 2010, pp. 1928-1932.
30. Y. Wu and A. Jiang, "Position modulation code for rewriting write-once memories," IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3692-3697, Jun. 2011, to be published.
31. E. Yaakobi, S. Kayser, P. H. Siegel, A. Vardy, and J. K. Wolf, "Efficient two-write WOM-codes," presented at the presented at the IEEE Inf. Theory Workshop, Dublin, Ireland, Aug. 2010.
32. E. Yaakobi, J. Ma, L. Grupp, P. H. Siegel, S. Swanson, and J. K. Wolf, "Error characterization and coding schemes for flash memories," presented at the presented at the Workshop Appl. Commun. Theory Emerg. Memory Technol. , Miami, FL, Dec. 2010.
33. E. Yaakobi, P. H. Siegel, A. Vardy, and J. K. Wolf, "Multiple errorcorrectingWOM- codes," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 2010, pp. 1933-1937.
34. G. Zémor, "Problèmes combinatoires liés à l'écriture sur des mémoires," Ph. D. dissertation, ENST, Paris, France, Feb. 1989.
35. G. Zémor and G. D. Cohen, "Error-correcting WOM-codes," IEEE Trans. Inf. Theory, vol. 37, no. 3, pp. 730-734, May 1991.