Please use this identifier to cite or link to this item:
|Title:||On the capacity of write-unidirectional memories with nonperiodic codes||Authors:||Fu, F.-W.
|Issue Date:||Apr-2004||Citation:||Fu, F.-W., Vinck, A.J.H., Wei, V.K., Yeung, R.W. (2004-04). On the capacity of write-unidirectional memories with nonperiodic codes. IEEE Transactions on Information Theory 50 (4) : 649-656. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2004.825047||Abstract:||Write-unidirectional memories (WUMs) were introduced by Willems, Vinck, and Borden as an information-theoretic model for storing and updating information on a rewritable medium with the writing constraints: During the odd (resp., even) cycles of updating information, the encoder can only write 1 's (resp., 0's) in selected bit positions of WUMs, and not change the contents of other positions. In this correspondence, motivated by the research works of Wolf, Wyner, Ziv, and Korner on write-once memories (WOMs), we study the problem of how to reuse a WUM for fixed T successive cycles with nonperiodic codes (i.e., all coding strategies are permitted for every cycle). For the situation where the encoder knows and the decoder does not know the previous content of the memory, we determine the zero-error capacity region, the average capacity, and the maximum total number of information bits stored in the WUM for fixed T successive cycles. Motivated by the research works of Heegard on WOMs with symmetric input noise, we introduce two models of WUMs with symmetric or asymmetric input noise. By using ε-error as performance criterion, we extend the above results for WUMs to the two models of WUMs with symmetric or asymmetric input noise.||Source Title:||IEEE Transactions on Information Theory||URI:||http://scholarbank.nus.edu.sg/handle/10635/111662||ISSN:||00189448||DOI:||10.1109/TIT.2004.825047|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.