Exponential error bounds for random codes on Gaussian arbitrarily varying channels
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 643-649
- https://doi.org/10.1109/18.79922
Abstract
The main objective is to develop exponential bounds to the best error probability achievable with random coding on the Gaussian arbitrarily varying channel (GAVC) in the one case where a (strong) capacity exists (i.e., with peak time-averaged power constraints on both the transmitter and interference). The GAVC models a channel corrupted by thermal noise and by an unknown interfering signal of bounded power. The upper and lower bounds to the best error probability achievable on this channel with random coding are presented. The asymptotic exponents of these bounds agree in a range of rates near capacity. The exponents are universally larger than the corresponding exponents for the discrete-time Gaussian channel with the same capacity. It is further shown that the decoder can be taken to be the minimum Euclidean distance rule at all rates less than capacity.Keywords
This publication has 4 references indexed in Scilit:
- Gaussian arbitrarily varying channelsIEEE Transactions on Information Theory, 1987
- ProbabilityPublished by Springer Nature ,1984
- Coding for a class of unknown channelsIEEE Transactions on Information Theory, 1966
- Probability of Error for Optimal Codes in a Gaussian ChannelBell System Technical Journal, 1959