Parallel decoding for channels with jamming

The authors describe optimum decoding algorithms that can be useful for channels with various forms of interference. These algorithms consider constrained receiver complexity in the following sense. For a fixed number of decoders or demodulators, or for a fixed tolerable time delay for multiple decoding attempts, what is the best decoding algorithm? Optimality is defined as the maximum least cost incurred by a jammer to cause a decoding error (or failure). The design of the decoders or demodulators is determined by a set of thresholds, each of which determines an erasure region. It is demonstrated that the formulation considered here is solvable for many channels including the simple M-ary input-output channel with the Hamming distance as the cost function, the additive channel where the cost function corresponds to Euclidean distance, and a noncoherent channel with ratio-threshold-like decision rules and difference metric decision rules