We introduce a general model of the rewritable storage channel in which rewriting can be used to improve storage capacity at the cost of encoding time. We then focus on a particular rewritable storage channel and show that if the average number of writes increases by a factor of c, storage capacity increases by an additional log c bits; we conjecture that capacity gains due to iterations for other scenarios will follow a similar trend. We will also discuss a number of open problems with practical significance in the context of rewritable storage channels.
By: L. A. Lastras-Montaño M. Franceschini, T. Mittelholzer, M. Sharma
Published in: RC24653 in 2008
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .