DECODING OF MATRIX-PRODUCT CODES
Fernando Hernando, Diego Ruano · Journal of Algebra and Its Applications · 2012
We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.