Error Bounds for Antijamming Group Codes on the Euclidean Channel

摘要

Spread-spectrum modulation is often used in channels subject to intentional interference. A mathematical model for this type of channel is the arbitrarily varying channel (AVC). It is natural to look at the jamming situation as a two-person zero-sum game. The author defines a class of antijamming codes for the Euclidean channel, together with an expression for the error probability. The upper bound is valid when the key rate tends towards infinity while the lower bound is valid for any key rate. From the results, the author concludes that by using coding techniques, it is possible to obtain low error probabilities also with intentional jamming.