Gaussian arbitrarily varying channels

The {\em 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 P_{T} and noise power N_{e} , which is further corrupted by an additive "jamming signal." The statistics of this signal are unknown and may be arbitrary, except that they are subject to a power constraint P_{J} . We distinguish between two types of power constraints: {\em peak} and {\em average.} For peak constraints on the input power and the jamming power we show that the GAVC has a random coding capacity. For the remaining cases in which either the transmitter or the jammer or both are subject to average power constraints, no capacities exist and only \lambda -capacities are found. The asymptotic error probability suffered by optimal random codes in these cases is determined. Our results suggest that if the jammer is subject only to an average power constraint, reliable communication is impossible at any positive code rate.

[1]  R. Ahlswede.  Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[2]  J. Wolfowitz.  Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[3]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[4]  R. McEliece,et al.  Some Information Theoretic Saddlepoints , 1985 .

[5]  Robert J. McEliece,et al.  A Study of Optimal Abstract Jamming Strategies vs. Noncoherent MFSK , 1983, MILCOM 1983 - IEEE Military Communications Conference.

[6]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[7]  T. Başar,et al.  Solutions to a class of minimax decision problems arising in communication systems , 1984, The 23rd IEEE Conference on Decision and Control.

[8]  S. W. Houston.  Modulation techniques for communication. I - Tone and noise jamming performance of spread spectrum M-ary FSK and 2, 4-ary DPSK waveforms , 1975 .

[9]  Brian Hughes,et al.  Interleaving and Channels with Unknown Memory. , 1985 .

[10]  Nelson M. Blachman,et al.  The effect of statistically dependent interference upon channel capacity , 1962, IRE Trans. Inf. Theory.

[11]  N. Blachman,et al.  On the capacity of a band-limited channel perturbed by statistically dependent interference , 1962, IRE Trans. Inf. Theory.

[12]  Robert M. Bell,et al.  Competitive Optimality of Logarithmic Investment , 1980, Math. Oper. Res..

[13]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[14]  Wayne E. Stark,et al.  An information theoretic study of communication in the presence of jamming , 1981 .

[15]  Suguru Arimoto,et al.  On the converse to the coding theorem for discrete memoryless channels (Corresp.) , 1973, IEEE Trans. Inf. Theory.