Conference
Universal Rewriting in Constrained Memories
Abstract
A constrained memory is a storage device whose elements change their states under some constraints. A typical example is flash memories, in which cell levels are easy to increase but hard to decrease. In a general rewriting model, the stored data changes with some pattern determined by the application. In a constrained memory, an appropriate representation is needed for the stored data to enable efficient rewriting. In this paper, we define the …
Authors
Jiang A; Langberg M; Schwartz M; Bruck J
Pagination
pp. 1219-1223
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
June 1, 2009
DOI
10.1109/isit.2009.5205981
Name of conference
2009 IEEE International Symposium on Information Theory