Probabilistic Coding for Write-Once Memory

Jun DU  Makoto TATEBAYASHI  Masao KASAHARA  

Publication
IEICE TRANSACTIONS (1976-1990)   Vol.E71   No.2   pp.132-138
Publication Date: 1988/02/25
Online ISSN: 
DOI: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Information Theory and Coding Theory
Keyword: 


Full Text: PDF(559.2KB)>>
Buy this Article




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.