Burst-error-correcting algorithm for Reed-Solomon codes

L. Yin, J. Lu, Khaled Letaief, Y. Wu

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n-k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existing algorithms, the algorithm enables much faster decoding with far less computational complexity.

Original languageEnglish
Pages (from-to)695-697
Number of pages3
JournalElectronics Letters
Volume37
Issue number11
DOIs
Publication statusPublished - 24 May 2001
Externally publishedYes

Fingerprint

Reed-Solomon codes
Decoding
Error correction
Computational complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Burst-error-correcting algorithm for Reed-Solomon codes. / Yin, L.; Lu, J.; Letaief, Khaled; Wu, Y.

In: Electronics Letters, Vol. 37, No. 11, 24.05.2001, p. 695-697.

Research output: Contribution to journalArticle

Yin, L. ; Lu, J. ; Letaief, Khaled ; Wu, Y. / Burst-error-correcting algorithm for Reed-Solomon codes. In: Electronics Letters. 2001 ; Vol. 37, No. 11. pp. 695-697.
@article{7a75233376bd44cdbdb634f465b805d3,
title = "Burst-error-correcting algorithm for Reed-Solomon codes",
abstract = "A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n-k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existing algorithms, the algorithm enables much faster decoding with far less computational complexity.",
author = "L. Yin and J. Lu and Khaled Letaief and Y. Wu",
year = "2001",
month = "5",
day = "24",
doi = "10.1049/el:20010461",
language = "English",
volume = "37",
pages = "695--697",
journal = "Electronics Letters",
issn = "0013-5194",
publisher = "Institution of Engineering and Technology",
number = "11",

}

TY - JOUR

T1 - Burst-error-correcting algorithm for Reed-Solomon codes

AU - Yin, L.

AU - Lu, J.

AU - Letaief, Khaled

AU - Wu, Y.

PY - 2001/5/24

Y1 - 2001/5/24

N2 - A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n-k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existing algorithms, the algorithm enables much faster decoding with far less computational complexity.

AB - A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n-k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existing algorithms, the algorithm enables much faster decoding with far less computational complexity.

UR - http://www.scopus.com/inward/record.url?scp=0035942624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035942624&partnerID=8YFLogxK

U2 - 10.1049/el:20010461

DO - 10.1049/el:20010461

M3 - Article

VL - 37

SP - 695

EP - 697

JO - Electronics Letters

JF - Electronics Letters

SN - 0013-5194

IS - 11

ER -