Paper Info
Title
Rewritable storage channels with limited number of rewrite iterations.
Abstract
We consider storage channels that admit optional reading and rewriting of the content at a given cost. This is a general class of channels that models many nonvolatile memories. We present recent results on such rewritable channels with constraints on both the maximum and the average number of atomic rewrite iterations. We derive a general lower capacity bound for rewritable storage channels impaired by additive noise. For the special case of uniform noise, we present tight upper and lower capacity bounds and suggest some capacity-achieving coding techniques.
Year
DOI
Venue
2010
10.1109/ISIT.2010.5513785
ISIT
Keywords
Field
DocType
digital storage,storage management,additive noise,atomic rewrite iterations,capacity achieving coding techniques,nonvolatile memories,rewritable storage channels
Computer science,Upper and lower bounds,Parallel computing,Communication channel,Coding (social sciences),Storage management,Rewriting,Decoding methods,Digital storage,Special case
Conference
Citations 
PageRank 
References 
3
0.48
0
Authors
4
Name
Order
Citations
PageRank
Thomas Mittelholzer112214.32
Luis Alfonso Lastras-Montaño227614.48
Mayank Sharma316822.18
Michele Franceschini473438.32