The Arbitrarily Varying Channel Under Constraints With Side Information at the Encoder
- 31 July 2018
- journal article
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (2) , 861-887
Abstract
We study the arbitrarily varying channel (AVC) with input and state constraints, when the encoder has state information in a causal or noncausal manner. For the causal state information setting, we develop lower and upper bounds on the random code capacity. A lower bound on the deterministic code capacity is established in the case of a message-averaged input constraint. In the setting where a state constraint is imposed on the jammer, while the user is under no constraints, the random code bounds coincide, and the random code capacity is determined. Furthermore, for this scenario, a generalized nonsymmetrizability condition is stated, under which the deterministic code capacity coincides with the random code capacity. For the noncausal state information setting, we determine the random code capacity of the AVC under input and state constraints. In addition, a condition on the channel is stated, under which the deterministic code capacity coincides with the random code capacity.Keywords
Funding Information
- Israel Science Foundation (1285/16)
This publication has 63 references indexed in Scilit:
- Biometric Security from an Information-Theoretical PerspectiveFoundations and Trends® in Communications and Information Theory, 2012
- Biometrics: A Tool for Information SecurityIEEE Transactions on Information Forensics and Security, 2006
- Quantization index modulation: a class of provably good methods for digital watermarking and information embeddingIEEE Transactions on Information Theory, 2001
- Capacity of the Gaussian arbitrarily varying channelIEEE Transactions on Information Theory, 1991
- Arbitrarily varying channels with states sequence known to the senderIEEE Transactions on Information Theory, 1986
- Exponential error bounds for random codes in the arbitrarily varying channelIEEE Transactions on Information Theory, 1985
- On the capacity of computer memory with defectsIEEE Transactions on Information Theory, 1983
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983
- Coding of arbitrarily varying multiuser channelsIEEE Transactions on Information Theory, 1981
- On general minimax theoremsPacific Journal of Mathematics, 1958