On the Capacity of Computer Memory with Defects

IEEE Transactions on Information Theory

Volumn 29, Issue 5, 1983, Pages 731-739

  Heegard, Chris ^a   El Gamal, Abbas A ^b  

^a Department of Obstetrics Gynecology   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE, DIGITAL;

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

References (20)

1. J. Wolfowitz, Coding Theorems of Information Theory, 3rd ed. New York: Springer Verlag, 1978.
2. A. V. Kusnetsov and B. S. Tsybakov, “Coding in a memory with defective cells,” translated from Prob. Peredach. Inform., vol. 10, no. 2, pp. 52-60, April-June 1974.
3. B. S. Tsybakov, “Additive group codes for defect correction,” translated from Prob. Peredach. Inform., vol. II, no. 1, pp. 111-113, January-March, 1975.
4. B. S. Tsybakov, S. I. Gel'fand, A. V. Kusnetsov, and S. I. Ortyukov, “Reliable Computation and reliable storage of information,” in Proc. 1975 IEEE-USSR Joint Workshop Inform. Theory, pp. 215-226, Dec. 15-19 1975.
5. I. B. Belov and A. M. Shashin, “Codes that correct triple defects in memory,” translated from Prob. Peredach. Inform., vol. 13, no. 4, pp. 62-65, October-December 1977.
6. V. V. Losev, V. K. Konopel'ko, and Yu. D. Daryakin, “Double-and-triple-defect-correcting codes,” translated from Prob. Peredach. Inform., vol. 14, no. 4, pp. 98-101, October-December 1978.
7. A. V. Kusnetsov, “Masking triple fixed defects in memory,” pre-print, Institute for Problems of Information Transmission, USSR Academy of Sciences.
8. A. V. Kusnetsov, T. Kasami, and S. Tamamura, “An error correcting scheme for defective memory,” IEEE Trans. Inform. Theory, vol. IT-24, no. 6, pp. 712-718, Nov. 1978.
9. S. I. Gel'fand and M. S. Pinsker, “Coding for channel with random parameters,” Prob. Contr. and Inform. Theory, vol. 9(1), pp. 19-31, 1980.
10. S. Arimoto, “An algorithm for computing the capacity of arbitrary discrete memoryless channels,” IEEE Trans. Inform. Theory, vol. IT-18, no. 1, pp. 14-20, Jan. 1972.
11. R. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Trans. Infor. Theory, vol. IT-18, no. 4, pp. 460-472, July 1972.
12. A. Viterbi and J. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
13. R. Ahlswede and T. S. Han, “On source coding with side information via a multiple-access channel and related problems in multi-user information theory,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 396-412, May 1983.
14. K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 306-311, May 1979.
15. A. A. El Gamal and E. van der Meulen, “A proof of Marton's coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 120-122, Jan. 1981.
16. A. A. El Gamal and T. M. Cover, “Information theory of joint descriptions,” Trans. Inform. Theory, pp. 851-857 Nov. 1982.
17. T. Berger, “Multi-terminal source coding,” CISM Courses and Lectures no. 229, The Information Theory Approach to Communications, G. Longo, Ed., 1977.
18. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
19. D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inform. Theory, vol. IT-19, no. 4, pp. 471-480, July 1973.
20. T. M. Cover, “A proof of the data compression theorem of Slepian and Wolf for ergodic sources,” IEEE Trans. Inform. Theory, vol. IT-21, no. 2, pp. 226-228, Mar. 1975.