List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes
![Thumbnail](/xmlui/bitstream/handle/10234/61065/53511.pdf.jpg?sequence=4&isAllowed=y)
Visualitza/
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:
INVESTIGACIONMetadades
Títol
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codesData de publicació
2012-01-30Editor
American Institute of Mathematical SciencesTipus de document
info:eu-repo/semantics/articleVersió
info:eu-repo/semantics/publishedVersionParaules clau / Matèries
Resum
A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear codes and A is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as ... [+]
A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear codes and A is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units [-]
Publicat a
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, v. 6, n. 3Drets d'accés
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Apareix a les col.leccions
- MAT_Articles [766]