Bounds and Code Constructions for Partially Defect Memory Cells

09/14/2020
by   Haider Al Kim, et al.
0

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 masking such partially stuck cells while additionally correcting errors. This construction (for cells with q >2 levels) is achieved by generalizing an existing masking-only construction in [1] (based on binary codes) to correct errors as well. Compared to previous constructions in [2], our new construction achieves larger rates for many sets of parameters. Second, we derive a sphere-packing (any number of u partially stuck cells) and a Gilbert-Varshamov bound (u<q partially stuck cells) for codes that can mask a certain number of partially stuck cells and correct errors additionally. A numerical comparison between the new bounds and our previous construction of PSMCs for the case u<q in [2] shows that our construction lies above the Gilbert-Varshamov-like bound for several code parameters.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/15/2022

Coding and Bounds for Partially Defective Memory Cells

This paper considers coding for so-called partially stuck (defect) memor...
11/07/2019

Error Correction for Partially Stuck Memory Cells

We present code constructions for masking u partially stuck memory cells...
05/13/2022

Codes for Preventing Zeros at Partially Defect Memory Positions

This work deals with error correction for non-volatile memories that are...
10/14/2018

Monads, partial evaluations, and rewriting

Monads can be interpreted as encoding formal expressions, or formal oper...
07/08/2018

Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes

In this paper, we study codes correcting t duplications of ℓ consecutive...
12/13/2020

Fine-Grained Lineage for Safer Notebook Interactions

Computational notebooks have emerged as the platform of choice for data ...
11/26/2019

Complexity bounds on supermesh construction for quasi-uniform meshes

Projecting fields between different meshes commonly arises in computatio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.