Correcting faults in write-once memory

Danny Dolev, David Maier, Harry Mairson, Jeffrey Ullman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We consider codes for write-once memory in tile presence of stuck-at-0 and stueb-at-1 faults. Such fault- Tolerant codes generally require less redundancy than error-correcting codes, as faults detected during the writing process can affect subsequent behavior of that process. We present pointer codes, which use part of a codeword to point to faults in other parts of the codeword. A pointer code can encode n-bit messages in the presence of f faults with only f(log2n + o(1)) redundancy. We derive a lower bound on the redundancy of such a fault-tolerant code of slightly less than f log n. We also examine some models where all stuck-at information is known in advance, and analyze the expected redundancy of pointer codes.

Original languageEnglish
Title of host publicationProceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984
PublisherAssociation for Computing Machinery
Pages225-229
Number of pages5
ISBN (Electronic)0897911334
DOIs
StatePublished - 1 Dec 1984
Event16th Annual ACM Symposium on Theory of Computing, STOC 1984 - Washington, United States
Duration: 30 Apr 19842 May 1984

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference16th Annual ACM Symposium on Theory of Computing, STOC 1984
Country/TerritoryUnited States
CityWashington
Period30/04/842/05/84

Bibliographical note

Publisher Copyright:
© 1984 ACM.

Fingerprint

Dive into the research topics of 'Correcting faults in write-once memory'. Together they form a unique fingerprint.

Cite this