Low complexity maximum-likelihood decoding of product codes

Many block codes can be represented as an intersection of two or more easily decoded codes. We present a new decoding algorithm for decoding product codes that utilizes this property. It will be shown that this algorithm is maximum-likelihood decoding. The complexity of the algorithm depends on the decoding complexity of the constituent codes and the quality of the channel.