TY - GEN
T1 - Rewritable channels with data-dependent noise
AU - Mittelholzer, Thomas
AU - Franceschini, Michele
AU - Lastras-Montaño, Luis A.
AU - Elfadel, Ibrahim M.
AU - Sharma, Mayank
PY - 2009
Y1 - 2009
N2 - We present some recent results on rewritable channels, that is, 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 focus on the storage capacity of rewritable channels affected by data-dependent noise. We prove tight upper and lower bounds on the storage capacity of a simple yet significant channel model and suggest some simple capacity-achieving coding techniques. Lower bounds on the storage capacity of Gaussian rewritable channels with data-dependent noise are also shown.
AB - We present some recent results on rewritable channels, that is, 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 focus on the storage capacity of rewritable channels affected by data-dependent noise. We prove tight upper and lower bounds on the storage capacity of a simple yet significant channel model and suggest some simple capacity-achieving coding techniques. Lower bounds on the storage capacity of Gaussian rewritable channels with data-dependent noise are also shown.
UR - http://www.scopus.com/inward/record.url?scp=70449487674&partnerID=8YFLogxK
U2 - 10.1109/ICC.2009.5199420
DO - 10.1109/ICC.2009.5199420
M3 - Conference contribution
AN - SCOPUS:70449487674
SN - 9781424434350
T3 - IEEE International Conference on Communications
BT - Proceedings - 2009 IEEE International Conference on Communications, ICC 2009
T2 - 2009 IEEE International Conference on Communications, ICC 2009
Y2 - 14 June 2009 through 18 June 2009
ER -