On the Capacity of Permanent Memory

IEEE Transactions on Information Theory

Volumn 31, Issue 1, 1985, Pages 34-42

  Heegard, Chris ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PERMANENT MEMORY; STORAGE CAPACITY;

DATA STORAGE, DIGITAL;

EID: 0021818141     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1056994     Document Type: Article

References (8)

1. Ronald L. Rivest and Adi Shamir, “How to reuse a “ write-once” memory,” Inform. Contr., vol. 55, 1–19, 1982.
2. A. V. Kusnetsov and B. S. Tsybakov, “Coding in a memory with defective cells,” translated from Problemy Peredachi Inforrnatsii, vol. 10, no. 2, pp. 52–60, Apr.—June 1974.
3. S. I. Gel'fand and M. S. Pinsker, “Coding for channel with random parameters,” Probl. Contr. Inform. Theory, vol. 9, no. 1, pp. 19–31, 1980.
4. Chris Heegard and Abbas El Gamal, “On the capacity of a computer memory with defects,” IEEE Trans. Inform. Theory, vol. IT-29, no. 5, pp. 731–739, Sep. 1983.
5. J. K. Wolf, A. D. Wyner, J. Ziv, and J. Körner, “ Coding for a write-once memory,” AT & T Bell Lab. Tech. J., pp. 1089–1112, July—Aug. 1984.
6. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes. North-Holland, 1977.
7. Toby Berger, “Multi-terminal source coding,” CISM Courses and Lectures No. 229, The Information Theory Approach to Communications, G. Longon, Ed. 1977.
8. Imre Csiszár and Janos Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems New York: Academic, 1982.