A construction of MDS array codes

Please use this identifier to cite or link to this item: http://hdl.handle.net/10045/41222
Información del item - Informació de l'item - Item information
Title: A construction of MDS array codes
Authors: Cardell, Sara D. | Climent, Joan-Josep | Requena Arévalo, Verónica
Research Group/s: Grupo de Álgebra y Geometría (GAG)
Center, Department or Service: Universidad de Alicante. Departamento de Estadística e Investigación Operativa
Keywords: Array code | MDS code | Block linear code | Finite field | Superregular matrix | Companion matrix | Primitive polynomial
Knowledge Area: Álgebra
Issue Date: 2013
Publisher: WIT Press
Citation: WIT Transactions on Information and Communication Technologies. 2013, 45: 47-58. doi:10.2495/DATA130051
Abstract: In this paper a new construction of MDS array codes is introduced. In order to obtain a code with this property, the parity-check matrix is constructed just using a superregular matrix of blocks composed of powers of the companion matrix of a primitive polynomial. Also a decoding algorithm for these codes is introduced.
Sponsor: The work of the first and the second authors was partially supported by Spanish grant MTM2011-24858 of the Ministerio de Economía y Competitividad of the Gobierno de España. The work of first author was also partially supported by a grant for research students from the Generalitat Valenciana with reference BFPI/2008/138. The work of the third author was partially supported by the research project UMH-Bancaja with reference IPZS01.
URI: http://hdl.handle.net/10045/41222
ISSN: 1746-4463 (Print) | 1743-3517 (Online)
DOI: 10.2495/DATA130051
Language: eng
Type: info:eu-repo/semantics/article
Rights: © 2013 WIT Press
Peer Review: si
Publisher version: http://dx.doi.org/10.2495/DATA130051
Appears in Collections:INV - GAG - Artículos de Revistas

Files in This Item:
Files in This Item:
File Description SizeFormat 
ThumbnailMDSArrayCodes-v5f.pdfVersión revisada (acceso abierto)224,75 kBAdobe PDFOpen Preview


Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.