Designing floating codes for expected performance

Authors:
Flavio Chierichetti;Hilary Finucane;Zhenming Liu;Michaell Mitzenmacher
Affiliations:
Dipartimento di Informatica, Sapienza University of Rome, Italy and School of Engineering and Applied Sciences, Harvard University, Cambridge, MA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA;School of Engineering and Applied Sciences, Harvard University, Cambridge, MA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 1

Coding for white-efficient memory

Information and Computation
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Universal rewriting in constrained memories

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A nearly optimal construction of flash codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph

IEEE Transactions on Information Theory
On the capacity and error-correcting codes of write-efficient memories

IEEE Transactions on Information Theory

Geometric WOM codes and coding strategies for multilevel flash memories

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, with each cell in one of q states {0, 1,...,q-1}. The cells are used to represent k variable values from an l-ary alphabet. Cells can move from lower values to higher values easily, but moving any cell from a higher value to a lower value requires first resetting the entire block to an all 0 state. Reset operations are to be avoided; generally a block can only experience a large but finite number of resets before wearing out entirely. A code here corresponds to a mapping from cell states to variable values, and a transition function that gives how to rewrite cell states when a variable is changed. Previous work has focused on developing codes that maximize the worst-case number of variable changes, or equivalently cell rewrites, that can be experienced before resetting. In this paper, we introduce the problem of maximizing the expected number of variable changes before resetting, given an underlying Markov chain that models variable changes. We demonstrate that codes designed for expected performance can differ substantially from optimal worst-case codes, and suggest constructions for some simple cases. We then study the related question of the performance of random codes, again focusing on the issue of expected behavior.