Decoding of Matrix-Product Codes
classification
💻 cs.IT
math.IT
keywords
algorithmcodecodesdecodingmatrix-productbeyondcapabilitycases
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.