Sábháilte in:
Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Hernando, Fernando, O'Sullivan, Michael, Ruano, Diego
Formáid: Preprint
Foilsithe / Cruthaithe: 2012
Ábhair:
Rochtain ar líne:https://arxiv.org/abs/1202.1238
Clibeanna: Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
_version_ 1866913334509436928
author Hernando, Fernando
O'Sullivan, Michael
Ruano, Diego
author_facet Hernando, Fernando
O'Sullivan, Michael
Ruano, Diego
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_1202_1238
institution arXiv
publishDate 2012
record_format arxiv
spellingShingle List decoding of repeated codes
Hernando, Fernando
O'Sullivan, Michael
Ruano, Diego
Information Theory
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.
title List decoding of repeated codes
topic Information Theory
url https://arxiv.org/abs/1202.1238