Decoding of matrix-product codes
Metadades
Mostra el registre complet de l'elementcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONAquest recurs és restringit
http://dx.doi.org/10.1142/S021949881250185X |
Metadades
Títol
Decoding of matrix-product codesData de publicació
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.Tipus de document
info:eu-repo/semantics/articleVersió de l'editorial
http://www.worldscientific.com/doi/abs/10.1142/S021949881250185XVersió
info:eu-repo/semantics/publishedVersionParaules clau / Matèries
Resum
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. [-]
Publicat a
Journal of Algebra and its Applications, 2013, 12.04Drets d'accés
© 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
Apareix a les col.leccions
- MAT_Articles [751]