Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels

作者: David Blackwell , Leo Breiman , A. J. Thomasian

DOI: 10.1214/AOMS/1177706452

关键词:

摘要: For finite-state indecomposable channels, Shannon's basic theorem, that transmission is possible at any rate less than channel capacity but not greater rate, proved. A necessary and sufficient condition for indecomposability, from which it follows every with finite memory indecomposable, given. An important tool a modification, some processes are quite stationary, of theorems McMillan Breiman on probabilities long sequences in ergodic processes.

参考文章(3)
J. Wolfowitz, The coding of messages subject to chance errors Illinois Journal of Mathematics. ,vol. 1, pp. 591- 606 ,(1957) , 10.1215/IJM/1255380682
Leo Breiman, The Individual Ergodic Theorem of Information Theory Annals of Mathematical Statistics. ,vol. 28, pp. 809- 811 ,(1957) , 10.1214/AOMS/1177706899
Amiel Feinstein, Foundations of Information Theory ,(1958)