Rewriting Codes for Joint Information Storage in Flash Memories Academic Article uri icon


  • Memories whose storage cells transit irreversibly between states have been common since the start of the data storage technology. In recent years, flash memories have become a very important family of such memories. A flash memory cell has q states-state 0, 1, ..., q-1-and can only transit from a lower state to a higher state before the expensive erasure operation takes place. We study rewriting codes that enable the data stored in a group of cells to be rewritten by only shifting the cells to higher states. Since the considered state transitions are irreversible, the number of rewrites is bounded. Our objective is to maximize the number of times the data can be rewritten. We focus on the joint storage of data in flash memories, and study two rewriting codes for two different scenarios. The first code, called floating code, is for the joint storage of multiple variables, where every rewrite changes one variable. The second code, called buffer code, is for remembering the most recent data in a data stream. Many of the codes presented here are either optimal or asymptotically optimal. We also present bounds to the performance of general codes. The results show that rewriting codes can integrate a flash memory's rewriting capabilities for different variables to a high degree. 2010 IEEE.

published proceedings


altmetric score

  • 3

author list (cited authors)

  • Jiang, A. A., Bohossian, V., & Bruck, J.

citation count

  • 41

complete list of authors

  • Jiang, Anxiao Andrew||Bohossian, Vasken||Bruck, Jehoshua

publication date

  • January 2010