English
Related papers

Related papers: A Nearly Optimal Construction of Flash Codes

200 papers

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

In this paper, we present an efficiently encodable and decodable code construction that is capable of correction a burst of deletions of length at most $k$. The redundancy of this code is $\log n + k(k+1)/2\log \log n+c_k$ for some constant…

Information Theory · Computer Science 2020-01-22 Andreas Lenz , Nikita Polyanskii

The pivotal storage density win achieved by solid-state devices over magnetic devices in 2015 is a result of multiple innovations in physics, architecture, and signal processing. One of the most important innovations in that regard is…

Information Theory · Computer Science 2022-09-07 Ahmed Hareedy , Simeng Zheng , Paul Siegel , Robert Calderbank

Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the "push to the top"…

Information Theory · Computer Science 2011-08-16 Eyal En Gad , Anxiao , Jiang , Jehoshua Bruck

The error correcting performance of multi-level-cell (MLC) NAND flash memory is closely related to the block length of error correcting codes (ECCs) and log-likelihood-ratios (LLRs) of the read-voltage thresholds. Driven by this issue, this…

Information Theory · Computer Science 2020-04-14 Cheng Wang , Kang Wei , Lingjun Kong , Long Shi , Zhen Mei , Jun Li , Kui Cai

In this work, we study a recently proposed direct shaping code for flash memory. This rate-1 code is designed to reduce the wear for SLC (one bit per cell) flash by minimizing the average fraction of programmed cells when storing structured…

Information Theory · Computer Science 2020-07-14 Yi Liu , Paul H. Siegel

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

The read channel of a Flash memory cell degrades after repetitive program and erase (P/E) operations. This degradation is often modeled as a function of the number of P/E cycles. In contrast, this paper models the degradation as a function…

Information Theory · Computer Science 2016-10-13 Haobo Wang , Nathan Wong , Tsung-Yi Chen , Richard D. Wesel

Multiple reads of the same Flash memory cell with distinct word-line voltages provide enhanced precision for LDPC decoding. In this paper, the word-line voltages are optimized by maximizing the mutual information (MI) of the quantized…

Information Theory · Computer Science 2014-02-20 Jiadong Wang , Kasra Vakilinia , Tsung-Yi Chen , Thomas Courtade , Guiqiang Dong , Tong Zhang , Hari Shankar , Richard Wesel

Erasure codes have become an integral part of distributed storage systems as a tool for providing data reliability and durability under the constant threat of device failures. In such systems, an $[n, k]$ code over a finite field…

Information Theory · Computer Science 2020-08-31 Francisco Maturana , K. V. Rashmi

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the "help-by-transfer" property where…

Information Theory · Computer Science 2017-08-04 Chao Tian , Birenjith Sasidharan , Vaneet Aggarwal , Vinay A. Vaishampayan , P. Vijay Kumar

We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of…

Information Theory · Computer Science 2021-05-07 Rawad Bitar , Serge Kas Hanna , Nikita Polyanskii , Ilya Vorobyev

This paper considers coding for so-called partially stuck memory cells. Such memory cells can only store partial information as some of their levels cannot be used due to, e.g., wear out. First, we present a new code construction for…

Information Theory · Computer Science 2021-03-18 Haider Al Kim , Sven Puchinger , Antonia Wachter-Zeh

The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into…

Quantum Physics · Physics 2025-09-30 Shouzhen Gu , Alex Retzker , Aleksander Kubica

The pivotal storage density win achieved by solid-state devices over magnetic devices recently is a result of multiple innovations in physics, architecture, and signal processing. Constrained coding is used in Flash devices to increase…

Information Theory · Computer Science 2023-11-15 Ahmed Hareedy , Simeng Zheng , Paul Siegel , Robert Calderbank

In this paper, for any fixed positive integers $t$ and $q>2$, we construct $q$-ary codes correcting a burst of at most $t$ deletions with redundancy $\log n+8\log\log n+o(\log\log n)+\gamma_{q,t}$ bits and near-linear encoding/decoding…

Information Theory · Computer Science 2024-05-02 Wentu Song , Kui Cai , Tony Q. S. Quek

To mitigate the impact of noise and interference on multi-level-cell (MLC) flash memory with the use of low-density parity-check (LDPC) codes, we propose a dynamic write-voltage design scheme considering the asymmetric property of raw bit…

Signal Processing · Electrical Eng. & Systems 2022-09-07 Runbin Cai , Yi Fang , Zhifang Shi , Lin Dai , Guojun Han

Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for flash memory array. Compared to previous related…

Information Theory · Computer Science 2017-01-24 Pengfei Huang , Eitan Yaakobi , Paul H. Siegel

This paper considers coding for so-called partially stuck (defect) memory cells. Such memory cells can only store partial information as some of their levels cannot be used fully due to, e.g., wearout. First, we present new constructions…

Information Theory · Computer Science 2022-02-16 Haider Al Kim , Sven Puchinger , Ludo Tolhuizen , Antonia Wachter-Zeh

We study error-correcting codes for permutations under the infinity norm, motivated by a novel storage scheme for flash memories call rank modulation. In this scheme, a set of $n$ flash cells are combined to create a single virtual…

Information Theory · Computer Science 2009-08-02 Itzhak Tamo , Moshe Schwartz