Name
Abstract | ||
|---|---|---|
A problem raised by R.L. Rivest and A. Shamir (1982), namely, constructing write-once-memory (WOM) codes capable of error correction, is considered. The authors call a (n,m,t)-WOM code a scheme that allows t successive writings of m arbitrary bits (i.e., one message among 2m) on a WOM of size n. WOM codes have been studied from an information-theoretic viewpoint by J.K. Wolf et al. (1984) and constructed using classical coding theory by G.D. Cohen et al. (1986, 1987) (for example, with parameters, (23,11,3), (2m-1,m,2m-2+2m-4+1)). The authors adapt those methods in order to solve the problem raised by Rivest. Large classes of easily decodable single-error-correcting WOM codes are obtained. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/18.79943 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
digital storage,error correction codes,WOM-codes,classical coding theory,error correction,information-theoretic viewpoint,write-once-memory codes | Discrete mathematics,Computer science,Read-write memory,Arithmetic,Error detection and correction,BCH code,Coding theory,Linear code,Digital storage,Decoding methods,Hamming weight | Journal |
Volume | Issue | ISSN |
37 | 3 | 0018-9448 |
Citations | PageRank | References |
35 | 2.41 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Zemor | 1 | 232 | 16.71 |
| Gérard Cohen | 2 | 877 | 176.34 |