2024-03-28T13:21:46Zhttp://uvadoc.uva.es/oai/requestoai:uvadoc.uva.es:10324/317442021-06-24T07:41:15Zcom_10324_32197com_10324_952com_10324_894com_10324_1129com_10324_931col_10324_32199col_10324_1193
Hernando, Fernando
O'Sullivan, Michael E.
Ruano Benito, Diego
2018-09-25T11:18:07Z
2018-09-25T11:18:07Z
2013
Applicable Algebra in Engineering, Communication and Computing. Volume 24, Issue 3-4, pages 237-253 (2013)
http://uvadoc.uva.es/handle/10324/31744
http://dx.doi.org/10.1007/s00200-013-0191-2
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.
eng
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
Attribution-NonCommercial-NoDerivatives 4.0 International
List decoding of repeated codes
info:eu-repo/semantics/article