List decoding of repeated codes

Hernando, Fernando; O'Sullivan, Michael E.; Ruano Benito, Diego

doi:10.1007/s00200-013-0191-2

Aviso: Si va a participar en la campaña de sexenios 2024, le recomendamos que deposite en UVaDoc de forma preferente las aportaciones que vaya a presentar a dicha convocatoria (opción Autoarchivo). El resto de sus publicaciones podrá subirlas al repositorio en cualquier otro momento. Gracias.

Por favor, use este identificador para citar o enlazar este ítem:http://uvadoc.uva.es/handle/10324/31744

Título

List decoding of repeated codes

Autor

Hernando, Fernando

O'Sullivan, Michael E.

Ruano Benito, Diego

Año del Documento

2013

Descripción

Producción Científica

Documento Fuente

Applicable Algebra in Engineering, Communication and Computing. Volume 24, Issue 3-4, pages 237-253 (2013)

Resumen

Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters, we show that they have a good performance with this algorithm. We compare, by computer simulations, our algorithm for the repeated code of a Reed-Solomon code against a decoding algorithm of a Reed-Solomon code. Finally, we estimate the decoding capability of the algorithm for Reed-Solomon codes and show that performance is somewhat better than our estimates.

Revisión por pares

DOI

10.1007/s00200-013-0191-2

Patrocinador

This research was partially supported by the National Science Foundation under Grant No. CCF-0916492, by the Danish National Research Foundation and the National Science Foundation of China (Grant No.11061130539) for the Danish-Chinese Center for Applications of Algebraic Geometry in Coding Theory and Cryptography, by the Spanish grant No. MTM2007-64704, and by the Spanish MINECO under grant No. MTM2012-36917-C03-03