Information Theory and Reliable Communication
Information Theory and Reliable Communication
Capacity and coding for computer memory with defects
Capacity and coding for computer memory with defects
Computation: finite and infinite machines
Computation: finite and infinite machines
An efficient I/O interface for optical disks
ACM Transactions on Database Systems (TODS)
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Data Integrty in Digital Optical Disks
IEEE Transactions on Computers
Modeling the performance of algorithms on flash memory devices
Proceedings of the 4th international workshop on Data management on new hardware
Coding-based energy minimization for phase change memory
Proceedings of the 49th Annual Design Automation Conference
| Hi-index | 0.00 |
Storage media such as digital optical disks, PROMS, or paper tape consist of a number of -&-ldquo;write-once-&-rdquo; bit positions (wits); each wit initially contains a -&-ldquo;0-&-rdquo; that may later be irreversibly overwritten with a -&-ldquo;I-&-rdquo;. We demonstrate that such -&-ldquo;write-once memories-&-rdquo; (woms) can be -&-ldquo;rewritten-&-rdquo; to a surprising degree. For example, only 3 wits suffice to represent any 2-bit value in a way that can later be updated to represent any other 2-bit value. For large k, 1.29... k wits suffice to represent a k-bit value in a way that can be similarly updated. Most surprising, allowing t writes of a k-bit value requires only t + o(t) wits, for any fixed k. For fixed t, approximately k.t/log(t) wits are required as k -&-rarr; @@@@. An n-wit WOM is shown to have a -&-ldquo;capacity-&-rdquo; (i.e. k.t when writing a k-bit value t times) of up to n.log(n) bits.