Linear binary code for write-once memories (Corresp.)

1 September 1986

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 32 (5) , 697-700
https://doi.org/10.1109/tit.1986.1057221

Abstract

An application of error-correcting codes to "write-once" memories (WOM's) as defined by Rivest and Shamir is studied. Large classes of "WOM codes" that are easily decodable are obtained. In particular, a construction allowing three successive writings of11bits on23positions is derived from the Golay code.

Keywords

This publication has 7 references indexed in Scilit:

Covering radius---Survey and recent results
IEEE Transactions on Information Theory, 1985
Coding for a Write-Once Memory
AT&T Bell Laboratories Technical Journal, 1984
How to reuse a “write-once≓ memory
Information and Control, 1982
On the covering radius of binary codes (Corresp.)
IEEE Transactions on Information Theory, 1978
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory, 1978
Graph Theory, Coding Theory and Block Designs
Published by Cambridge University Press (CUP) ,1975
Shortened BCH codes (Corresp.)
IEEE Transactions on Information Theory, 1973