On the capacity of computer memory with defects
- 1 September 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (5) , 731-739
- https://doi.org/10.1109/tit.1983.1056723
Abstract
A computer memory with defects is modeled as a discrete memoryless channel with states that are statistically determined. The storage capacity is found when complete defect information is given to the encoder or to the decoder, and when the defect information is given completely to the decoder but only partially to the encoder. Achievable storage rates are established when partial defect information is provided at varying rates to both the encoder and the decoder. Arimoto-Blahut type algorithms are used to compute the storage capacity.Keywords
This publication has 10 references indexed in Scilit:
- The CEO problem [multiterminal source coding]IEEE Transactions on Information Theory, 1996
- On source coding with side information via a multiple-access channel and related problems in multi-user information theoryIEEE Transactions on Information Theory, 1983
- A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)IEEE Transactions on Information Theory, 1981
- A coding theorem for the discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1979
- An error correcting scheme for defective memoryIEEE Transactions on Information Theory, 1978
- Coding Theorems of Information TheoryPublished by Springer Nature ,1978
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- An algorithm for computing the capacity of arbitrary discrete memoryless channelsIEEE Transactions on Information Theory, 1972