English
Related papers

Related papers: Using Short Synchronous WOM Codes to Make WOM Code…

200 papers

In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size $M$ can…

Information Theory · Computer Science 2018-02-14 Yoju Fujino , Tadashi Wadayama

In this paper we give several new constructions of WOM codes. The novelty in our constructions is the use of the so called Wozencraft ensemble of linear codes. Specifically, we obtain the following results. We give an explicit construction…

Information Theory · Computer Science 2011-11-01 Amir Shpilka

In recent years, due to the spread of multi-level non-volatile memories (NVM), $q$-ary write-once memories (WOM) codes have been extensively studied. By using WOM codes, it is possible to rewrite NVMs $t$ times before erasing the cells. The…

Information Theory · Computer Science 2016-05-18 Evyatar Hemo , Yuval Cassuto

This paper investigates the design and application of write-once memory (WOM) codes for flash memory storage. Using ideas from Merkx ('84), we present a construction of WOM codes based on finite Euclidean geometries over $\mathbb{F}_2$.…

Information Theory · Computer Science 2012-06-26 Kathryn Haymaker , Christine A. Kelley

A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding…

Information Theory · Computer Science 2012-10-09 David Burshtein , Alona Strugatski

This paper constructs WOM codes that combine rewriting and error correction for mitigating the reliability and the endurance problems in flash memory. We consider a rewriting model that is of practical interest to flash applications where…

Information Theory · Computer Science 2015-02-03 Eyal En Gad , Wentao Huang , Yue Li , Jehoshua Bruck

Flash memory is a write-once medium in which reprogramming cells requires first erasing the block that contains them. The lifetime of the flash is a function of the number of block erasures and can be as small as several thousands. To…

Information Theory · Computer Science 2015-04-23 Eitan Yaakobi , Alexander Yucovich , Gal Maor , Gala Yadgar

We propose a new Write-Once-Memory (WOM) coding scheme based on source polarization. By applying a source polarization transformation on the to-be-determined codeword, the proposed WOM coding scheme encodes information into the bits in the…

Information Theory · Computer Science 2014-10-28 Xudong Ma

A write-once memory (wom) is a storage medium formed by a number of ``write-once'' bit positions (wits), where each wit initially is in a `0' state and can be changed to a `1' state irreversibly. Examples of write-once memories include SLC…

Information Theory · Computer Science 2010-01-05 Yunnan Wu , Anxiao Jiang

Write-Once-Memory (WOM) is a model for many modern non-volatile memories, such as flash memories. Recently, several capacity-achieving WOM coding schemes have been proposed based on polar coding. Due to the fact that practical computer…

Information Theory · Computer Science 2014-11-18 Xudong Ma

High density Solid State Drives, such as QLC drives, offer increased storage capacity, but a magnitude lower Program and Erase (P/E) cycles, limiting their endurance and hence usability. We present the design and implementation of…

Hardware Architecture · Computer Science 2022-08-02 Shehbaz Jaffer , Kaveh Mahdaviani , Bianca Schroeder

In data storage and data transmission, certain patterns are more likely to be subject to error when written (transmitted) onto the media. In magnetic recording systems with binary data and bipolar non-return-to-zero signaling, patterns that…

Information Theory · Computer Science 2020-02-25 Ahmed Hareedy , Robert Calderbank

\emph{Resistive memories}, such as \emph{phase change memories} and \emph{resistive random access memories} have attracted significant attention in recent years due to their better scalability, speed, rewritability, and yet non-volatility.…

Information Theory · Computer Science 2021-09-22 Yeow Meng Chee , Michal Horovitz , Alexander Vardy , Van Khu Vu , Eitan Yaakobi

The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we…

Information Theory · Computer Science 2016-10-05 Gianluigi Liva , Lorenzo Gaudio , Tudor Ninacs , Thomas Jerkovits

The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer…

Information Theory · Computer Science 2015-01-05 Eyal En Gad , Eitan Yaakobi , Anxiao , Jiang , Jehoshua Bruck

This paper presents a practical writing/reading scheme in nonvolatile memories, called balanced modulation, for minimizing the asymmetric component of errors. The main idea is to encode data using a balanced error-correcting code. When…

Information Theory · Computer Science 2012-09-05 Hongchao Zhou , Anxiao , Jiang , Jehoshua Bruck

For discrete memoryless multiple-access channels, we propose a general definition of variable length codes with a measure of the transmission rates at the receiver side. This gives a receiver perspective on the multiple-access channel…

Information Theory · Computer Science 2011-02-28 Stephane Musy

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the…

Information Theory · Computer Science 2019-02-27 Michel Kulhandjian , Hovannes Kulhandjian , Claude D'Amours , Halim Yanikomeroglu , Gurgen Khachatrian

In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decoding algorithms. The block length of our construction is…

Information Theory · Computer Science 2012-09-07 Amir Shpilka

We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message…

Information Theory · Computer Science 2020-01-14 Kuan Cheng , Xin Li , Yu Zheng
‹ Prev 1 2 3 10 Next ›