Decoding of matrix-product codes.

Título

dc.contributor.author	Hernando, Fernando
dc.contributor.author	Ruano Benito, Diego
dc.date.accessioned	2018-09-25T11:30:10Z
dc.date.available	2018-09-25T11:30:10Z
dc.date.issued	2013
dc.identifier.citation	Journal of Algebra and its Applications. Volume 12, Issue 4, Article ID 1250185 (2013)	es
dc.identifier.uri	http://uvadoc.uva.es/handle/10324/31748
dc.description	Producción Científica	es
dc.description.abstract	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.	es
dc.format.mimetype	application/pdf	es
dc.language.iso	eng	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.title	Decoding of matrix-product codes.	es
dc.type	info:eu-repo/semantics/article	es
dc.identifier.doi	http://dx.doi.org/10.1142/S021949881250185X	es
dc.peerreviewed	SI	es
dc.description.project	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	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 International