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

Jørn Justesen

Research output: Contribution to journalJournal articleResearchpeer-review

137 Downloads (Pure)

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.
Original languageEnglish
JournalI E E E Transactions on Information Theory
Volume53
Issue number8
Pages (from-to)2881 - 2885
ISSN0018-9448
DOIs
Publication statusPublished - 2007

Bibliographical note

Copyright: 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm'. Together they form a unique fingerprint.

Cite this