Linear binary code for write-once memories (Corresp.)
作者： G. Cohen , P. Godlewski , F. Merkx
关键词: Binary Golay code 、 Arithmetic 、 Binary code 、 Computer science 、 Prefix code 、 Error detection and correction 、 Code (cryptography) 、 Write-once 、 Linear code
摘要: An application of error-correcting codes to "write-once" memories (WOM's) as defined by Rivest and Shamir is studied. Large classes "WOM codes" that are easily decodable obtained. In particular, a construction allowing three successive writings 11 bits on 23 positions derived from the Golay code.
acm.org
sci-hub.se 参考文章(6)
Ronald L. Rivest, Adi Shamir, How to reuse a “write-once≓ memory* Information & Computation. ,vol. 55, pp. 1- 19 ,(1982) , 10.1016/S0019-9958(82)90344-8
H. Helgert, R. Stinaff, Shortened BCH codes (Corresp.) IEEE Transactions on Information Theory. ,vol. 19, pp. 818- 820 ,(1973) , 10.1109/TIT.1973.1055099
E. Berlekamp, R. McEliece, H. van Tilborg, On the inherent intractability of certain coding problems (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 384- 386 ,(1978) , 10.1109/TIT.1978.1055873
T. Helleseth, T. Klove, J. Mykkeltveit, On the covering radius of binary codes (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 627- 628 ,(1978) , 10.1109/TIT.1978.1055928
Covering radius---Survey and recent results IEEE Transactions on Information Theory. ,vol. 31, pp. 328- 343 ,(1985) , 10.1109/TIT.1985.1057043
J. K. Wolf, A. D. Wyner, J. Ziv, J. Körner, Coding for a Write-Once Memory AT&T Bell Laboratories Technical Journal. ,vol. 63, pp. 1089- 1112 ,(1984) , 10.1002/J.1538-7305.1984.TB00115.X