2026-03-13T16:50:26Zhttps://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

Decoding of matrix-product codes. Hernando, Fernando Ruano Benito, Diego Producción Científica 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. Supported in part by the Danish National Research Foundation and the National Science Foundation of China (Grant No.11061130539) for the Danish-Chinese Center for Applications of Algebraic Geometry in Coding Theory and Cryptography, and Spanish MEC MTM2007-64704 2018-09-25T11:30:10Z 2018-09-25T11:30:10Z 2013 info:eu-repo/semantics/article https://doi.org/10.1142/S021949881250185X Journal of Algebra and its Applications. Volume 12, Issue 4, Article ID 1250185 (2013) http://uvadoc.uva.es/handle/10324/31748 eng Attribution-NonCommercial-NoDerivatives 4.0 International info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/4.0/ application/pdf