Bounded Minimum Distance Decoding of (P)UM Codes Based on RS Codes

In this paper, we describe the construction of (partial) unit memory ((P)UM) codes based on RS codes and discuss an algorithm for bounded minimum distance decoding of these codes up to half the “designed” extended row distance. The complexity of this algorithm is upper bounded by $4k_1K_B$, where $k_1$ denotes the memory of the (P)UM code and $K_B$ is the complexity for a bounded minimum distance decoder of a component block code of the (P)UM code considered.