About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ITA 2010
Conference paper
Superposition coding in rewritable channels
Abstract
We introduce the notions of superposition coding and sequential decoding in the context of rewritable channels. Using these concepts we will show that for Κ1 > Κ0, C(Κ1) ≥ C(Κ0)+log (?1/ Κ0), where C(·) is the capacity of the rewritable channel for a given cost. A consequence of this result is that C(Κ) ≥ C(1) + log Κ, where C(1) is the classical channel capacity with no rewrite iterations. Thus this result provides a connection between rewritable and classical channel theory. We also derive a general upper bound on capacity which can be written as an offset plus the logarithm of the average number of write iterations. Closed form bounds on rewritable channel capacity will be given for Gaussian rewritable channels.