A General Formula for Channel Capacity

IEEE Transactions on Information Theory

Volumn 40, Issue 4, 1994, Pages 1147-1157

  Verdú, Sergio ^a   Han, Te Sun ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

channel capacity; channel coding theorem; channels with memory; Shannon theory; strong converse

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); ERRORS; PROBABILITY;

CHANNEL CODING THEOREM; CODEWORD; ERGODIC BEHAVIOR; FANO INEQUALITY; INFORMATION STABILITY; NORMALIZED INFORMATION DENSITY; SHANNON THEORY;

CHANNEL CAPACITY;

EID: 0028461972     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.335960     Document Type: Article

References (26)

1. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379-423, 623-656, July-Oct. 1948.
2. R. L. Dobrushin, “General formulation of Shannon's main theorem in information theory,” Amer. Math. Soc. Trans., vol. 33, pp. 323-438, AMS, Providence, RI, 1963.
3. G. D. Hu, “On Shannon theorem and its converse for sequences of communication schemes in the case of abstract random variables,” in Proc. 3rd Prague Conf. Inform. Theory, Statist. Decision Functions, Random Processes. Prague: Czechoslovak Acad. Sci., 1964, pp. 285-333.
4. R. M. Gray and L. D. Davisson, Ergodic and Information Theory. Stroudsbourg, PA: Dowden, Hutchinson & Ross, 1977.
5. J. Nedoma, “The capacity of a discrete channel,” in Proc. 1st Prague Conf. Inform. Theory, Statist. Decision Functions, Random Processes, Prague, 1957, pp. 143-181.
6. R. Ahlswede, “The weak capacity of averaged channels,” Z. Wahrscheinlichkeitstheorie verw. Geb., vol. 11, pp. 61-73, 1968.
7. K. Winkelbauer, “On the coding theorem for decomposable discrete information channels I,” Kybernetika, vol. 7, no. 2, pp. 109-123, 1971.
8. J. Nedoma, “On nonergodic channels,” in Proc. 2nd Prague Conf. Inform. Theory, Statist. Decision Functions, Random Processes, Prague, 1960, pp. 363-395.
9. J. C. Kieffer, “A general formula for the capacity of stationary nonanticipatory channels,” Inform. Contr., vol. 26, pp. 381-391, 1974.
10. T. S. Han and S. Verdu, “Approximation theory of output statistics,” IEEE Trans. Inform. Theory, vol. 39, pp. 752-772, May 1993.
11. R. M. Gray, Entropy and Information Theory. New York: Springer-Verlag, 1990.
12. J. Wolfowitz, Coding Theorems of Information Theory, 3rd ed. New York: Springer, 1978.
13. I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
14. R. M. Gray and D. S. Ornstein, “Block coding for discrete stationary d-bar continuous noisy channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 292-306, May 1979.
15. A. Feinstein, “A new basic theorem of information theory,” IRE Trans. Inform. Theory, vol. IT-4, pp. 2-22, 1954.
16. L. Le Cam, Asymptotic Methods in Statistical Decision Theory. New York: Springer, 1986.
17. H. V. Poor and S. Verdu, “A lower bound on the probability of error in multihypothesis testing,” in Proc. 1993 Allerton Conf. Commun., Contr., Computing, Monticello, IL, pp. 758-759, Sept. 1993.
18. S. Vembu, S. Verdu, and Y. Steinberg, “The joint source-channel separation theorem revisited,” IEEE Trans. Inform.' Theory, vol. 41, to appear, 1995.
19. J. Wolfowitz, “The coding of messages subject to chance errors,” Illinois J. Math., vol. 1, pp. 591-606, Dec. 1957.
20. —, “On channels without capacity,” Inform. Contr., vol. 6, pp. 49-54, 1963.
21. M. S. Pinsker,. Information and Information Stability of Random Variables and Processes. San Francisco: Holden-Day, 1964.
22. K. R. Parthasarathy, “Effective entropy rate and transmission of information through channels with additive random noise,” Sankhya, vol. A25, no. 1, pp. 75-84, 1963.
23. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
24. T. M. Cover, “Broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 2-14, Jan. 1972.
25. F. S. Hill, Jr. and M. A. Blanco, “Random geometric series and intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 326-335, May 1973.
26. J. Ziv, “The Capacity of the General Time-Discrete Channel with Finite Alphabet,” Information and Control, vol. 14, pp. 233-251, 1969.