Optimization of Concatenated Decoding Algorithms

The correcting properties of concatenated and iterative codes implemented in various algorithms for their concatenated decoding are investigated. An assessment of the correcting properties (multiplicity of reliably corrected errors) is obtained by the analysis of a game situation with the channel and the decoder as players. The losses of the channel in this case are estimated in terms of the multiplicity of the error sets, and the losses of the decoder are estimated in terms of the number of decoding trials. A minimax strategy is found for a fixed number of decoding attempts.