A coding theorem for a class of unknown channels
- 1 April 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 13 (2) , 217-220
- https://doi.org/10.1109/tit.1967.1053973
Abstract
We consider the problem of communication over a channel which is selected 1) in a fashion unknown to the communicator, 2) as a function of past history, 3) from a given set of discrete memoryless channels, and 4) for the purpose of maximizing the degradation in performance. An upperbound on error probability insurable with block coding is obtained which exponentially approaches zero with block length for rates less than capacity. Techniques for the communicator to achieve these results are considered. The design of relatively simple communication techniques for channels with memory and jammed channels are discussed.Keywords
This publication has 5 references indexed in Scilit:
- Coding for a class of unknown channelsIEEE Transactions on Information Theory, 1966
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965
- Coding Theorems of Information TheoryPublished by Springer Nature ,1961
- The Capacities of Certain Channel Classes Under Random CodingThe Annals of Mathematical Statistics, 1960
- The Capacity of a Class of ChannelsThe Annals of Mathematical Statistics, 1959