Probabilistic Coding for Write-Once Memory

Jun DU; Makoto TATEBAYASHI; Masao KASAHARA

Probabilistic Coding for Write-Once Memory

Jun DU, Makoto TATEBAYASHI, Masao KASAHARA

Full Text Views

0

Cite this

Summary :

The literature on codes for write-once memories (WOM) has been growing steadily in recent years. In this paper, a new method for constructing womcodes is presented. On the basis of the numerical analysis and the computer simulations related to the performance of the proposed womcodes, we show that the codes have the rates higher than any other known womcodes. The upper bounds on the rates of the codes are obtained as well. We also show that, by combining the proposed womcodes with other womcodes known previously, we can significantly improve the utilization efficiency of WOM.

Publication: IEICE TRANSACTIONS on transactions Vol.E71-E No.2 pp.132-138

Publication Date: 1988/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Theory and Coding Theory

Authors

Jun DU
Makoto TATEBAYASHI
Masao KASAHARA

Keyword

Cite this

Copy

Jun DU, Makoto TATEBAYASHI, Masao KASAHARA, "Probabilistic Coding for Write-Once Memory" in IEICE TRANSACTIONS on transactions, vol. E71-E, no. 2, pp. 132-138, February 1988, doi: .
Abstract: The literature on codes for write-once memories (WOM) has been growing steadily in recent years. In this paper, a new method for constructing womcodes is presented. On the basis of the numerical analysis and the computer simulations related to the performance of the proposed womcodes, we show that the codes have the rates higher than any other known womcodes. The upper bounds on the rates of the codes are obtained as well. We also show that, by combining the proposed womcodes with other womcodes known previously, we can significantly improve the utilization efficiency of WOM.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e71-e_2_132/_p

Copy

@ARTICLE{e71-e_2_132,
author={Jun DU, Makoto TATEBAYASHI, Masao KASAHARA, },
journal={IEICE TRANSACTIONS on transactions},
title={Probabilistic Coding for Write-Once Memory},
year={1988},
volume={E71-E},
number={2},
pages={132-138},
abstract={The literature on codes for write-once memories (WOM) has been growing steadily in recent years. In this paper, a new method for constructing womcodes is presented. On the basis of the numerical analysis and the computer simulations related to the performance of the proposed womcodes, we show that the codes have the rates higher than any other known womcodes. The upper bounds on the rates of the codes are obtained as well. We also show that, by combining the proposed womcodes with other womcodes known previously, we can significantly improve the utilization efficiency of WOM.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Probabilistic Coding for Write-Once Memory
T2 - IEICE TRANSACTIONS on transactions
SP - 132
EP - 138
AU - Jun DU
AU - Makoto TATEBAYASHI
AU - Masao KASAHARA
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 2
JA - IEICE TRANSACTIONS on transactions
Y1 - February 1988
AB - The literature on codes for write-once memories (WOM) has been growing steadily in recent years. In this paper, a new method for constructing womcodes is presented. On the basis of the numerical analysis and the computer simulations related to the performance of the proposed womcodes, we show that the codes have the rates higher than any other known womcodes. The upper bounds on the rates of the codes are obtained as well. We also show that, by combining the proposed womcodes with other womcodes known previously, we can significantly improve the utilization efficiency of WOM.
ER -