Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm

Authors:
J. Justesen
Affiliations:
Tech. Univ. of Denmark, Lyngby
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 1

Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2

Quantified Score

Hi-index	754.84

Visualization

Abstract

By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of Reed-Solomon codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when two or more sets of received symbols have substantially different reliabilities, or when the number of alternative transmitted symbols is very small.