Universal rewriting in constrained memories

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.

[1]  Paul H. Siegel,et al.  Multidimensional flash codes , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[2]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[3]  Chris Heegard,et al.  On the capacity of permanent memory , 1985, IEEE Trans. Inf. Theory.

[4]  Rudolf Ahlswede,et al.  On multiuser write-efficient memories , 1994, IEEE Trans. Inf. Theory.

[5]  Anxiao Jiang,et al.  Joint coding for flash memory storage , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  Gérard D. Cohen,et al.  Linear binary code for write-once memories , 1986, IEEE Trans. Inf. Theory.

[7]  Frans Merkx.  09 - Womcodes constructed with projective geometries , 1984 .

[8]  Gérard D. Cohen,et al.  Error-correcting WOM-codes , 1991, IEEE Trans. Inf. Theory.

[9]  Amy Hsiu-Fen Chou,et al.  Flash Memories , 2000, The VLSI Handbook.

[10]  A. Fiat,et al.  Generalized 'write-once' memories , 1984, IEEE Trans. Inf. Theory.

[11]  Gábor Simonyi,et al.  On write-unidirectional memory codes , 1989, IEEE Trans. Inf. Theory.

[12]  Zhenming Liu,et al.  Designing Floating Codes for Expected Performance , 2010, IEEE Transactions on Information Theory.

[13]  A. J. Han Vinck,et al.  On the general defective channel with informed encoder and capacities of some constrained memories , 1994, IEEE Trans. Inf. Theory.

[14]  W.M.C.J. van Overveld.  The four cases of write unidirectional memory codes over arbitrary alphabets , 1991, IEEE Trans. Inf. Theory.

[15]  Paul H. Siegel,et al.  A nearly optimal construction of flash codes , 2009, 2009 IEEE International Symposium on Information Theory.

[16]  Jack K. Wolf,et al.  Coding for a write-once memory , 1984, AT&T Bell Laboratories Technical Journal.

[17]  Béla Bollobás,et al.  Random Graphs: Preface to the Second Edition , 2001 .

[18]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[19]  A. J. Han Vinck,et al.  On the Capacity of Generalized Write-Once Memory with State Transitions Described by an Arbitrary Directed Acyclic Graph , 1999, IEEE Trans. Inf. Theory.

[20]  Anxiao Jiang,et al.  Buffer Coding for Asymmetric Multi-Level Memory , 2007, 2007 IEEE International Symposium on Information Theory.

[21]  Fang-Wei Fu,et al.  On the capacity and error-correcting codes of write-efficient memories , 2000, IEEE Trans. Inf. Theory.

[22]  Anxiao Jiang,et al.  Floating Codes for Joint Information Storage in Write Asymmetric Memories , 2007, 2007 IEEE International Symposium on Information Theory.

[23]  Adi Shamir,et al.  How to reuse a "write - once " memory (Preliminary Version) , 1982, STOC '82.