Decoding of Matrix-Product Codes

Abstract

We propose a decoding algorithm for the $(u\mid 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.

Cited by in corpus (4)

• Matrix Product Codes over Finite Commutative Frobenius Rings
• New Quantum Codes from Evaluation and Matrix-Product Codes
• About the generalized Hamming weights of matrix-product codes
• On Decoding of Generalized Concatenated Codes and Matrix-Product Codes