DECODING OF MATRIX-PRODUCT CODES

From MaRDI portal



Abstract: We propose a decoding algorithm for the (umidu+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 in
(23)








This page was built for publication: DECODING OF MATRIX-PRODUCT CODES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923923)