On the Capacity of Write-Once Memories

被引:5
作者
Horovitz, Michal [1 ]
Yaakobi, Eitan [1 ]
机构
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
基金
以色列科学基金会;
关键词
Coding theory; flash memories; write-once memory (WOM)-codes; multi-level memories; capacity region; maximum sum-rate; z-channel; erasure channel; asymmetric errors; CODES;
D O I
10.1109/TIT.2017.2689034
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Write-once memory (WOM) is a storage device consisting of q-ary cells that can only increase their value. A WOM code is a coding scheme that allows writing multiple times to the memory without decreasing the levels of the cells. In the conventional model, it is assumed that the encoder can read the memory state before encoding, while the decoder reads only the memory state after encoding. However, there are three more models in this setup, which depend on whether the encoder and the decoder are informed or uninformed with the previous state of the memory. These four models were first introduced by Wolf et al., where they extensively studied the WOM capacity in these models for the binary case. In the non-binary setup, only the model, in which the encoder is informed and the decoder is not, was studied by Fu and Vinck. In this paper, we first present constructions of WOM codes in the models where the encoder is uninformed with the memory state (that is, the encoder cannot read the memory prior to encoding). We then study the capacity regions and maximum sum-rates of non-binary WOM codes for all four models. We extend the results by Wolf et al. and show that the capacity regions for the models in which the encoder is informed and the decoder is informed or uninformed in both the epsilon-error and the zero-error cases are all identical. We also find the epsilon-error capacity region; in this case, the encoder is uninformed and the decoder is informed and show that, in contrary to the binary case, it is a proper subset of the capacity region in the first two models. Several more results on the maximum sum-rate are presented as well.
引用
收藏
页码:5124 / 5137
页数:14
相关论文
共 28 条
[11]   A COMPARISON OF SIGNALLING ALPHABETS [J].
GILBERT, EN .
BELL SYSTEM TECHNICAL JOURNAL, 1952, 31 (03) :504-522
[12]   ON THE CAPACITY OF PERMANENT MEMORY [J].
HEEGARD, C .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (01) :34-42
[13]  
Helgesen C., 1984, ASYMMETRIC ERROR COR
[14]  
Horovitz M., 2015, P IEEE INF THEOR WOR, P1
[15]  
Horovitz M, 2016, IEEE INT SYMP INFO, P945, DOI 10.1109/ISIT.2016.7541438
[16]  
Lele Wang, 2011, Proceedings of the 2011 IEEE International Symposium on Information Theory - ISIT, P2527, DOI 10.1109/ISIT.2011.6034023
[17]   NEW UPPER BOUNDS ON RATE OF A CODE VIA DELSARTE-MACWILLIAMS INEQUALITIES [J].
MCELIECE, RJ ;
RODEMICH, ER ;
RUMSEY, H ;
WELCH, LR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (02) :157-166
[18]  
Rao T. R. N., 1975, Proceedings of the 7th Annual Southeastern Symposium on System Theory, P170
[19]   HOW TO REUSE A WRITE-ONCE MEMORY [J].
RIVEST, RL ;
SHAMIR, A .
INFORMATION AND CONTROL, 1982, 55 (1-3) :1-19
[20]  
Sharon E., 2013, NONV MEM WORKSH SAN