Rank modulation for flash memories
IEEE Transactions on Information Theory
Universal rewriting in constrained memories
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the lifetime of multilevel memories
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Rewriting codes for joint information storage in flash memories
IEEE Transactions on Information Theory
Designing floating codes for expected performance
IEEE Transactions on Information Theory
Capacity achieving two-write WOM codes
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
Geometric WOM codes and coding strategies for multilevel flash memories
Designs, Codes and Cryptography
Hi-index | 755.02 |
The generalized write-once memory introduced by Fiat and Shamir (1984) is a q-ary information storage medium. Each storage cell is expected to store one of q symbols, and the legal state transitions are described by an arbitrary directed acyclic graph. This memory model can be understood as a generalization of the binary write-once memory which was introduced by Rivest and Shamir (1982). During the process of updating information, the contents of a cell can be changed from a 0-state to a 1-state but not vice versa. We study the problem of reusing a generalized write-once memory for T successive cycles (generations). We determine the zero-error capacity region and the maximum total number of information hits stored in the memory for T consecutive cycles for the situation where the encoder knows and the decoder does not know the previous state of the memory. These results extend the results of Wolf, Wyner, Ziv, and Korner (1984) for the binary write-once memory