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 language | English |
---|---|
Title of host publication | Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984 |
Publisher | Association for Computing Machinery |
Pages | 225-229 |
Number of pages | 5 |
ISBN (Electronic) | 0897911334 |
DOIs | |
State | Published - 1 Dec 1984 |
Event | 16th Annual ACM Symposium on Theory of Computing, STOC 1984 - Washington, United States Duration: 30 Apr 1984 → 2 May 1984 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
ISSN (Print) | 0737-8017 |
Conference
Conference | 16th Annual ACM Symposium on Theory of Computing, STOC 1984 |
---|---|
Country/Territory | United States |
City | Washington |
Period | 30/04/84 → 2/05/84 |
Bibliographical note
Publisher Copyright:© 1984 ACM.