Designing floating codes for expected performance

IEEE Transactions on Information Theory

Volumn 56, Issue 3, 2010, Pages 968-978

  Chierichetti, Flavio ^a   Finucane, Hilary ^b   Liu, Zhenming ^b   Mitzenmacher, Michael ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Average case analysis; Floating codes; Random floating codes; Write asymmetric memory

Indexed keywords

AVERAGE-CASE ANALYSIS; CELL STATE; FINITE NUMBER; MARKOV CHAIN; Q STATE; RANDOM CODES; TRANSITION FUNCTIONS; VARIABLE CHANGE;

FLASH MEMORY; MARKOV PROCESSES;

CELLS;

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

References (24)

1. R. Ahlswede and Z. Zhang, "Coding for write-efficient memory," Inf. Computat., pp. 80-97, 1989.
2. R. Bez, E. Camerlenghi, A. Modelli, and A. Visconti, "Introduction to flash memory," Proc. IEEE, vol.91, no.4, pp. 489-502, 2003.
3. V. Bohossian, A. Jiang, and J. Bruck, "Buffer coding for asymmetric multi-level memory," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 1186-1190.
4. Y. Cassuto, M. Schwartz, V. Bohossian, and J. Bruck, "Codes for multi-level flash memories: Correcting asymmetric limited-magnitude errors," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 1176-1180.
5. A. Fiat and A. Shamir, "Generalized 'write-once' memories," IEEE Trans. Inf. Theory, vol.IT-30, pp. 470-480, 1984.
6. H. Finucane and M. Mitzenmacher, Worst-Case and Average-Case Floating Codes for Flash Memory Harvard Comput. Sci. Tech. Rep. TR-04-09.
7. F. Fu and A. J. Han Vinck, "On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph," IEEE Trans. Inf. Theory, vol.45, no.1, pp. 308-313, 1999.
8. F. Fu and R. W. Yeung, "On the capacity and error-correcting codes of write-efficient memories," IEEE Trans. Inf. Theory, vol.46, no.7, pp. 2299-2314, 2000.
9. F. Gray, "Pulse Code Communications," U.S. Patent 2632058, Mar. 1953.
10. C. Heegard, "On the capacity of permanent memory," IEEE Trans. Inf. Theory, vol.IT-31, pp. 34-42, 1985.
11. C. Heegard and A. El Gamal, "On the capacity of computer memory with defects," IEEE Trans. Inf. Theory, vol.IT-29, pp. 731-739, 1983.
12. A. Jiang, "On the generalization of error-correcting WOM codes," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 1391-1395.
13. A. Jiang, V. Bohossian, and J. Bruck, "Floating codes for joint information storage in write asymmetric memories," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 1166-1170.
14. A. Jiang and J. Bruck, "Joint coding for flash memory storage," in Proc. IEEE Int. Symp. Inf. Theory, 2008, pp. 1741-1745.
15. A. Jiang, M. Landberg, M. Schwartz, and J. Bruck, "Universal rewriting in constrained memories," in Proc. IEEE Int. Symp. Inf. Theory, 2009, to be published.
16. A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck, "Rank modulation for flash memories," in Proc. IEEE Int. Symp. Inf. Theory , 2008, pp. 1731-1735.
17. H. Mahdavifar, P. Siegel, A. Vardy, J.Wolf, and E. Yaakobi, "A nearly optimal construction for flash codes," in Proc. IEEE Int. Symp. Inf. Theory, 2009, to be published.
18. V. Malyshev and M. Menshikov, "Ergodicity, continuity and analyticity of countable Markov chains," Trans. Moscow Math. Soc., vol.39, pp. 3-48, 1979.
19. S. Meyn and R. Tweedie, its Markov Chains and Stochastic Stability. New York: Springer, 1996.
20. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2005.
21. R. L. Rivest and A. Shamir, "How to reuse a 'write-once" memory," Inf. Control, vol. 55, pp. 227-231, 1984.
22. G. Simonyi, "On write-unidirectional memory codes," IEEE Trans. Inf. Theory, vol.35, no.3, pp. 663-669, 1989.
23. J. K.Wolf, A. D.Wyner, J. Ziv, and J. Körner, "Coding for a write-once memory," AT&T Bell Lab. Tech. J., vol.63, no.6, pp. 1089-1112, 1984.
24. E. Yaakobi, A. Vardy, P. Siegel, and J. Wolf, "Multidimensional flash codes," in Proc. 2008 Allerton Conf., 2008.