Graph Decomposition: A New Key to Coding Theorems

IEEE Transactions on Information Theory

Volumn 27, Issue 1, 1981, Pages 5-12

  CsiszáR, Imre ^a   KöRner, JáNos ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

CLASSIFICATION; CURVE FITTING; INFORMATION SCIENCE; MATHEMATICAL MODEL; METHODOLOGY; NONBIOLOGICAL MODEL;

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

References (18)

1. L. Lovász, “On decomposition of graphs,” Studia Sci. Math. Hung., Vol. 1, pp. 237–238, 1966.
2. C. E. Shannon, “The zero-error capacity of a noisy channel,” IRE Trans. Inform. Theory, Vol. 2, pp. 8–19, 1956. Reprinted in Key Papers in The Development of Information Theory, D. Slepian, Ed. New York: IEEE Press, 1974.
3. E. C. Posner and R. J. McEliece, “Hide and seek, data storage and entropy,” Annals Math. Statist., Vol. 42, pp. 1706–1716, 1971.
4. H. S. Witsenhausen, “The zero-error side information problem and chromatic numbers,” IEEE Trans. Inform. Theory, Vol. IT-22, pp. 592–593, 1976.
5. G. Dueck and J. Korner, “Reliability function of a discrete memoryless oryless channel at rates above capacity,” IEEE Tram. Inform. Theory, Vol. IT-25, pp. 82–85, 1979.
6. I. Csiszar, J. Korner, and K. Marton, “A new look at the error exponent of a discrete memoryless channel,” presented at the IEEE Int. Symp. Inform. Theory, Cornell University, Ithaca, NY, Oct. 1977.
7. V. D. Goppa, “Nonprobabilistic mutual information without memory,” (in Russian), Problems Control Inform. Theory, Vol. 4, pp. 97–102, 1975.
8. E. A. Haroutunian, “Estimates of the error exponent for the semi-continuous memoryless channel,” (in Russian), Probl. Peradachi adachi Inform. Vol. 4, pp. 37–48, 1968.
9. R. E. Blahut, “Hypothesis testing and information theory,” IEEE Trans. Inform. Theory, Vol. IT-20, pp. 405–417, 1974.
10. R. M. Fano, Transmission of information: A statistical theory of communications. New York: Wiley, 1961.
11. R. G. Gallager, “A simple derivation of the coding theorem and some applications,” IEEE Trans. Inform. Theory, Vol. IT-11, pp. 3–18, 1965. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, Ed. New York: IEEE Press, 1974.
12. I. Csiszar, and J. Komer, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, to appear.
13. J. K. Omura, “Expurgated bounds, Bhattacharyya distance and rate distortion functions.” Inform. Contr., Vol. 24, pp. 358–383, 1974.
14. R. E. Blahut, “Composition bounds for channel block codes,” IEEE Trans. Inform. Theory, Vol. IT-23, pp. 656–674, 1977.
15. D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inform. Theory Vol. IT-19, pp. 471–480, 1973. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, Ed. New York: IEEE Press, 1974.
16. R. G. Gallager, “Source coding with side information and universal coding,” presented at the IEEE Int. Symp. Inform. Theory, Ronneby, Sweden, July 1976.
17. V. N. Koklev, “On a problem of separate coding of two dependent sources” (in Russian), Probl. Per. Inform. Vol. 13, pp. 26–32, 1977.
18. I. Csiszar and J. Korner, “Towards a general theory of source networks,” IEEE Trans. Inform. Theory, Vol. 1T-26, pp. 155–165, Mar. 1980.