Decoding of Matrix-Product Codes

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.

[1]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[2]  Bram van Asch,et al.  Matrix-product codes over finite chain rings , 2008, Applicable Algebra in Engineering, Communication and Computing.

[3]  Fernando Hernando,et al.  Construction and decoding of matrix-product codes from nested codes , 2009, Applicable Algebra in Engineering, Communication and Computing.

[4]  Graham H. Norton,et al.  Matrix-Product Codes over ?q , 2001, Applicable Algebra in Engineering, Communication and Computing.

[5]  Fernando Hernando,et al.  New linear codes from matrix-product codes with polynomial units , 2010, Adv. Math. Commun..

[6]  Henning Stichtenoth,et al.  Note on Niederreiter-Xing's Propagation Rule for Linear Codes , 2002, Applicable Algebra in Engineering, Communication and Computing.