Coding for write-efficient memory

DOI10.1016/0890-5401(89)90048-5zbMath0677.68063OpenAlexW2022850264MaRDI QIDQ1123626

Zhen Zhang

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1775115

zbMATH Keywords

WEMwrite-efficient memory

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99) Theory of computing (68Q99)

Related Items (8)

Models of multi-user write-efficient memories and general diametric theorems ⋮ Geometric WOM codes and coding strategies for multilevel flash memories ⋮ On the minimum average distance of binary constant weight codes ⋮ Write-isolated memories (WIMs) ⋮ On the variance of average distance of subsets in the Hamming space ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES ⋮ Report on models of write–efficient memories with localized errors and defects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contributions to the geometry of Hamming spaces
• On storage media with aftereffects
• On source coding with side information via a multiple-access channel and related problems in multi-user information theory
• How to reuse a “write-once≓ memory
• On the capacity of computer memory with defects
• Coding for a Write-Once Memory
• On the capacity of permanent memory
• Arbitrarily varying channels with states sequence known to the sender
• On write-unidirectional memory codes
• Writing on dirty paper (Corresp.)

This page was built for publication: Coding for write-efficient memory