A symbol-by-symbol MAP decoding rule for linear codes over rings using the dual code
Jens Berkmann · 2002
A symbol-by-symbol maximum a posteriori (MAP) decoding rule for codes over integer rings is presented which uses the dual code. This rule results in lower complexity decoding for high-rate codes and generalizes earlier results for the field case to codes over integer rings. The suitability of the decoding rule is demonstrated by applying it to an iterative 'turbo'-(de)coding scheme employing convolutional codes over Z/sub M/ in conjunction with M-PSK.