Decoding of matrix-product codes
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1142/S021949881250185X |
Metadatos
Título
Decoding of matrix-product codesFecha de publicación
2013-06Editor
World Scientific Publishing CompanyISSN
0219-4988Cita bibliográfica
HERNANDO, Fernando; RUANO, Diego. Decoding of matrix-product codes. Journal of Algebra and its Applications, 2013, 12.04.Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://www.worldscientific.com/doi/abs/10.1142/S021949881250185XVersión
info:eu-repo/semantics/publishedVersionPalabras clave / Materias
Resumen
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. ... [+]
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. [-]
Publicado en
Journal of Algebra and its Applications, 2013, 12.04Derechos de acceso
© 2013, World Scientific Publishing Company
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- MAT_Articles [766]