We consider two communication systems which are time-discrete and memoryless, both depend on a state, in terms of information-theoretic secure data transmission. The compound channel consists of a finite or infinite set of channels which is known to both the sender and the receiver, but unfortunately it is not known which channel is in use for any codeword transmission. In contrast the state of...

This paper extends recent results on steganographic capacity. We derive capacity expressions for perfectly-secure steganographic systems. The warden may be passive, or active using a memoryless attack channel, or active using an arbitrarily varying channel. Neither encoder nor decoder know which channel was selected by the warden. In some cases, the steganographic constraint does not result in ...

The minimum probability of error achievable by random codes on the arbitrarily varying channel (AVC) is investigated. New exponential error bounds are found and applied to the AVC with and without input and state constraints. Also considered is a simple subclass of random codes, called randomly modulated codes, in which encoding and decoding operations are separate from code randomization. A un...

The arbitrarily varying channel (AVC) can be interpreted as a model of a channel jammed by an intelligent and unpredictable adversary. We investigate the asymptotic reliability of optimal random block codes on Gaussian arbitrarily varying channels (GAVC’s). A GAVC is a discrete-time memoryless Gaussian channel with input power constraint PT and noise power N,, which is further corrupted by an a...

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency d...

by Ebrahim MolavianJazi In this thesis, we consider a class of information protection problems requiring confidentiality (secrecy) from eavesdropping and integrity (reliability) from jamming in an information-theoretic context. For this purpose, we introduce the arbitrarily varying wire-tap channel (AVWTC) model consisting of a family of wiretap channels indexed by some state that is selected b...