Error-Correcting Wom-Codes

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 730-734

  Zémor, Gilles ^a   Cohen, Gérard D ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Algebraic coding; covering radius; memories; write once

Indexed keywords

DATA STORAGE, DIGITAL; INFORMATION THEORY; MATHEMATICAL TECHNIQUES - MATRIX ALGEBRA;

ALGEBRAIC CODING; COVERING RADIUS; ERROR-CORRECTING WOM-CODES; WRITE-ONCE MEMORIES (WOM);

CODES, SYMBOLIC;

EID: 0026153180     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79943     Document Type: Article

References (8)

1. G. D. Cohen, P. Godlewski, and F. Merkx, Linear block codes for write-once memories,” IEEE Trans. Inform. Theory, IT-32, no. 5, pp. 697–700, Sept. 1986.
2. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, Jr., and J. R. Shatz, “Covering radius—Survey and recent results,” IEEE Trans. Inform. Theory, vol. IT-31, no. 3, pp. 328–343, May 1985.
3. P. Godlewski, “WOM-codes construits a partir des codes de Hamming,” Discrete Math., vol. 65, pp. 237–243, 1987.
4. J. A. van der Horst and T. Berger, “Complete decoding of triple-error-correcting binary BCH codes,” IEEE Trans. Inform. Theory, vol. IT-22, no. 2, pp. 133–147, Mar. 1976.
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
6. R. L. Rivest, and A. Shamir, “How to reuse a write-once memory,” Inform. and Contr., vol. 55, pp. 1–19, 1982.
7. J. K. Wolf, A. D. Wyner, J. Ziv, and J. Korner, “Coding for write-once memory,” AT&T Bell Lab. Tech. J., vol. 63, no. 6, pp. 1089–1112, 1984.
8. G. Zemor, “Problemes combinatoires lies a l'écriture sur des memoires, Ph.D. dissertation, ENST, Paris, France, Nov. 1989.