On Write-Unidirectional Memory Codes

IEEE Transactions on Information Theory

Volumn 35, Issue 3, 1989, Pages 663-669

  Simonyi, Gábor ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE, DIGITAL;

FIBONACCI SEQUENCES; WRITE-UNIDIRECTIONAL MEMORY CODES; WUM CODES;

CODES, SYMBOLIC;

EID: 0024668841     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.30992     Document Type: Article

References (10)

1. J. M. Borden, “Coding for write-unidirectional memories,” submitted to IEEE Trans. Inform. Theory.
2. F. M. J. Willems and A. J. Vinck, “Repeated recording for an opticaldisk,” in Proc. 7th Symp. Information Theory in the Benelux, May 22-23, 1986, pp. 49-53.
3. R. L. Rivest and A. Shamir, “How to reuse a ”write-once “memory,” Inform. Contr., vol. 55, pp. 1-19, 1982.
4. J. K. Wolf, A. D. Wyner, J. Ziv, and J. Körner, “Coding for a write-oncememory,” Bell Syst. Tech. J., vol. 63, no. 6, pp. 1089-1112, July-Aug. 1984.
5. G. D. Cohen, P. Godlewski, and F. Merkx, “Linear binary codes forwrite-once memories,” IEEE Trans. Inform. Theory, vol. IT-32, no. 5, pp. 697-700, Sept. 1986.
6. Z. Baranyai, “ On the factorization of the complete uniform hypergraph,” in Infinite and Finite Sets, A. Hajnal, R. Rado, and Vera T. Sós, Eds.Amsterdam, The Netherlands, and London: North-Holland, 1975.
7. G. Simonyi, “On write-unidirectional memories,” internal rep., EcoleNationale Supérieure des Télécommunications, Paris, France, 1986.
8. G. O. H. Katona, “Extremal problems for hypergraphs,” Math. CentreTracts, vol. 56, pp. 13-42, 1974.
9. L. Lováz, Combinatorial Problems and Exercises. New York: North-Holland, 1979.
10. G. Tardos, personal communication.