2026-03-13T17:46:41Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/317482024-12-18T15:53:22Zcom_10324_32197com_10324_952com_10324_894com_10324_1129com_10324_931col_10324_32199col_10324_1193

Hernando, Fernando Ruano Benito, Diego 2018-09-25T11:30:10Z 2018-09-25T11:30:10Z 2013 Journal of Algebra and its Applications. Volume 12, Issue 4, Article ID 1250185 (2013) http://uvadoc.uva.es/handle/10324/31748 10.1142/S021949881250185X 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. eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0/ Attribution-NonCommercial-NoDerivatives 4.0 International Decoding of matrix-product codes. info:eu-repo/semantics/article