Capacity and decoding rules for classes of arbitrarily varying channels
- 1 July 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (4) , 752-769
- https://doi.org/10.1109/18.32153
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The capacity of the arbitrarily varying channel revisited: positivity, constraintsIEEE Transactions on Information Theory, 1988
- Arbitrarily varying channels with constrained inputs and statesIEEE Transactions on Information Theory, 1988
- Arbitrarily varying channels with states sequence known to the senderIEEE Transactions on Information Theory, 1986
- On the capacity of computer memory with defectsIEEE Transactions on Information Theory, 1983
- Communication in the Presence of Jamming-An Information-Theoretic ApproachPublished by Springer Nature ,1983
- On the capacity of the arbitrarily varying channel for maximum probability of errorProbability Theory and Related Fields, 1981
- Graph decomposition: A new key to coding theoremsIEEE Transactions on Information Theory, 1981
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabetProbability Theory and Related Fields, 1970