Por favor, use este identificador para citar o enlazar este ítem:http://uvadoc.uva.es/handle/10324/31748
Título
Decoding of matrix-product codes.
Año del Documento
2013
Descripción
Producción Científica
Documento Fuente
Journal of Algebra and its Applications. Volume 12, Issue 4, Article ID 1250185 (2013)
Zusammenfassung
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.
Revisión por pares
SI
Patrocinador
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
Idioma
eng
Derechos
openAccess
Aparece en las colecciones
Dateien zu dieser Ressource
![Attribution-NonCommercial-NoDerivatives 4.0 International](/themes/Mirage2//images/creativecommons/cc-by-nc-nd.png)