The Optimal Code Rate vs. a Partial Band Jammer

1 October 1982

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 1, 8.5-1-8.5-4
https://doi.org/10.1109/milcom.1982.4805908

Abstract

We take an abstract view of the problem of coding vs. a jammer on a binary symmetric channel, and conclude that either: coding can completely newtralize the jammer, i.e. render him no worse than uniform background noise; or: the best code rate is exactly r = .3790. Here "best" is with respect to channel capacity as a figure of merit. If the channel cutoff rate is used instead, the best rate is .247. We also give some extensions to M-ary channels, M ≥ 2.

Keywords

JAMMING
SIGNAL TO NOISE RATIO
TRANSMITTERS
BACKGROUND NOISE
CHANNEL CAPACITY
SHAPE
EQUATIONS
RANDOM VARIABLES
VITERBI ALGORITHM
CAPACITY PLANNING

This publication has 2 references indexed in Scilit:

Channels with block interference
IEEE Transactions on Information Theory, 1984
Spread spectrum communications--Myths and realities
IEEE Communications Magazine, 1979