On (Partial) unit memory codes based on Gabidulin codes
Problems of Information Transmission
| Hi-index | 754.84 |
We propose an algorithm for bounded minimum distance decoding of (partial) unit memory codes up to half the “designed” extended row distance. It makes use of a reduced trellis with the nodes found by bounded minimum distance decoding of the block codes used in the unit memory code. The results can be extended to general multimemory codes. The complexity of this algorithm is upper bounded by 2(d¯ 1r-2dα) times the complexity of the bounded minimum distance decoder of the block codes in the unit memory code. Here dα is the linear increase of the designed extended row distance d¯ir