Mostrar el registro sencillo del ítem

Decoding of matrix-product codes

dc.contributor.authorHernando, Fernando
dc.contributor.authorRuano, Diego
dc.date.accessioned2014-04-10T11:21:37Z
dc.date.available2014-04-10T11:21:37Z
dc.date.issued2013-06
dc.identifier.citationHERNANDO, Fernando; RUANO, Diego. Decoding of matrix-product codes. Journal of Algebra and its Applications, 2013, 12.04.ca_CA
dc.identifier.issn0219-4988
dc.identifier.urihttp://hdl.handle.net/10234/90051
dc.description.abstractWe 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.ca_CA
dc.format.extent15 p.ca_CA
dc.format.mimetypeapplication/pdfca_CA
dc.language.isoengca_CA
dc.publisherWorld Scientific Publishing Companyca_CA
dc.relation.isPartOfJournal of Algebra and its Applications, 2013, 12.04ca_CA
dc.rights© 2013, World Scientific Publishing Companyca_CA
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/*
dc.subjectLinear codesca_CA
dc.subjectmatrix-product codesca_CA
dc.subjectdecoding algorithmca_CA
dc.subjectminimum distanceca_CA
dc.titleDecoding of matrix-product codesca_CA
dc.typeinfo:eu-repo/semantics/articleca_CA
dc.identifier.doihttp://dx.doi.org/10.1142/S021949881250185X
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_CA
dc.relation.publisherVersionhttp://www.worldscientific.com/doi/abs/10.1142/S021949881250185Xca_CA
dc.type.versioninfo:eu-repo/semantics/publishedVersion


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem