List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes (Q1760061)

In the paper the authors consider a new list-decoding algorithm for a class of matrix-product codes, extending a known algorithm. They compute its error bound and complexity. They also provide some computations to estimate an upper bound of the probability of getting more than one codeword as output, when the matrix-product codes are Reed-Solomon codes. Finally, the authors extend the algorithm to matrix-product codes with polynomial units, which are quasi-cyclic codes. The main advantage of this approach with respect to Reed-Solomon codes is the possibility of considering longer codes without increasing the field size and still using the fast decoding algorithms for the constituent codes. As a conclusion, this is a well-written paper with important results.