Coding and bounds for partially defective memory cells

DOI10.1007/s10623-023-01270-0arXiv2202.07541OpenAlexW4386185797MaRDI QIDQ6070355

Sven Puchinger, Haider Al Kim, L. M. G. M. Tolhuizen, Antonia Wachter-Zeh

Publication date: 20 November 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.07541

zbMATH Keywords

error-correcting codesGilbert-Varshamov boundflash memoriesnon-volatile memories(partially) stuck cellsdefective memory

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60) Burst-correcting codes (94B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotically optimal codes correcting memory defects of fixed multiplicity
• Coding in a channel with generalized defects and random errors
• Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity
• Codes for Partially Stuck-At Memory Cells
• Linear codes for masking memory defects (Corresp.)
• Partitioned linear block codes for computer memory with 'stuck-at' defects
• On coding for 'stuck-at' defects (Corresp.)
• On the structure of convolutional and cyclic convolutional codes
• An error correcting scheme for defective memory
• Averaging bounds for lattices and linear codes
• A note on alphabet codes and fields of computation
• A Bound for the Maximum Weight of a Linear Code
• A Bound for Error-Correcting Codes
• Generalizations of the BCH bound
• Introduction to Coding Theory

This page was built for publication: Coding and bounds for partially defective memory cells