RT info:eu-repo/semantics/article
T1 Decoding of matrix-product codes.
A1 Hernando, Fernando
A1 Ruano Benito, Diego
AB 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.
YR 2013
FD 2013
LK http://uvadoc.uva.es/handle/10324/31748
UL http://uvadoc.uva.es/handle/10324/31748
LA eng
NO Journal of Algebra and its Applications. Volume 12, Issue 4, Article ID 1250185 (2013)
NO Producción Científica
DS UVaDOC
RD 14-oct-2024