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

Jørn Justesen

doi:10.1109/TIT.2007.901169

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

Jørn Justesen

Research output: Contribution to journal › Journal article › Research › peer-review

295 Downloads (Orbit)

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 language	English
Journal	I E E E Transactions on Information Theory
Volume	53
Issue number	8
Pages (from-to)	2881 - 2885
ISSN	0018-9448
DOIs	https://doi.org/10.1109/TIT.2007.901169
Publication status	Published - 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

Access to Document

10.1109/TIT.2007.901169

JustesenFinal published version, 172 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{09316530eb7b4d9b94fc70fdb90e95de,

title = "Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm",

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.",

author = "J{\o}rn Justesen",

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",

year = "2007",

doi = "10.1109/TIT.2007.901169",

language = "English",

volume = "53",

pages = "2881 -- 2885",

journal = "I E E E Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "8",

}

TY - JOUR

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

AU - Justesen, Jørn

N1 - 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

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

U2 - 10.1109/TIT.2007.901169

DO - 10.1109/TIT.2007.901169

M3 - Journal article

SN - 0018-9448

VL - 53

SP - 2881

EP - 2885

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

IS - 8

ER -

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

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this