Por favor, use este identificador para citar o enlazar este ítem:http://uvadoc.uva.es/handle/10324/31744
List decoding of repeated codes
Año del Documento
Applicable Algebra in Engineering, Communication and Computing. Volume 24, Issue 3-4, pages 237-253 (2013)
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
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
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International