Arbitrarily varying channels with general alphabets and states
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (6) , 1725-1742
- https://doi.org/10.1109/18.165446
Abstract
Previous results of Csiszar and Narayan (1988, 1989, 1991) on the capacity of discrete arbitrarily varying channels with input and state constraints are extended to the case of arbitrary alphabets and state sets. For channels with scalar or vector inputs and additive interference consisting of a deterministic part and noise, both arbitrarily varying subject to power constraints, the capacity for deterministic codes is shown to be equal to the random coding capacity if the input power exceeds the power of the deterministic interference, and zero otherwise. Explicit capacity formulas are also givenKeywords
This publication has 9 references indexed in Scilit:
- Capacity of the Gaussian arbitrarily varying channelIEEE Transactions on Information Theory, 1991
- Capacity and decoding rules for classes of arbitrarily varying channelsIEEE Transactions on Information Theory, 1989
- The capacity of a vector Gaussian arbitrarily varying channelIEEE Transactions on Information Theory, 1988
- 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
- Some Information Theoretic SaddlepointsSIAM Journal on Control and Optimization, 1985
- Communication in the Presence of Jamming-An Information-Theoretic ApproachPublished by Springer Nature ,1983
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978
- The Capacities of Certain Channel Classes Under Random CodingThe Annals of Mathematical Statistics, 1960