Decoding algorithm for DEC RS codes

Erl Huei Lu; Chiou Yng Lee; Ron Lon Tsai

doi:10.1049/el:20000436

Decoding algorithm for DEC RS codes

Erl Huei Lu, Chiou Yng Lee, Ron Lon Tsai

Chang Gung University

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

11 Scopus citations

Abstract

A step-by-step decoding algorithm is proposed for double-error-correcting Reed-Solomon codes of length n = 2^m-1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular; therefore, it is suitable for hardware implementation.

Original language	English
Pages (from-to)	546-548
Number of pages	3
Journal	Electronics Letters
Volume	36
Issue number	6
DOIs	https://doi.org/10.1049/el:20000436
State	Published - 16 03 2000

Access to Document

10.1049/el:20000436

Cite this

@article{e7cbe39096eb4cc2a1920a31520ebe23,

title = "Decoding algorithm for DEC RS codes",

abstract = "A step-by-step decoding algorithm is proposed for double-error-correcting Reed-Solomon codes of length n = 2m-1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular; therefore, it is suitable for hardware implementation.",

author = "Lu, \{Erl Huei\} and Lee, \{Chiou Yng\} and Tsai, \{Ron Lon\}",

year = "2000",

month = mar,

day = "16",

doi = "10.1049/el:20000436",

language = "英语",

volume = "36",

pages = "546--548",

journal = "Electronics Letters",

issn = "0013-5194",

publisher = "John Wiley \& Sons Inc.",

number = "6",

}

TY - JOUR

T1 - Decoding algorithm for DEC RS codes

AU - Lu, Erl Huei

AU - Lee, Chiou Yng

AU - Tsai, Ron Lon

PY - 2000/3/16

Y1 - 2000/3/16

N2 - A step-by-step decoding algorithm is proposed for double-error-correcting Reed-Solomon codes of length n = 2m-1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular; therefore, it is suitable for hardware implementation.

AB - A step-by-step decoding algorithm is proposed for double-error-correcting Reed-Solomon codes of length n = 2m-1. Since the decoding algorithm can directly find the error value at the highest-order position in a received vector without determining the error location polynomial, the decoding procedure is very simple and regular; therefore, it is suitable for hardware implementation.

UR - https://www.scopus.com/pages/publications/0033870915

U2 - 10.1049/el:20000436

DO - 10.1049/el:20000436

M3 - 文章

AN - SCOPUS:0033870915

SN - 0013-5194

VL - 36

SP - 546

EP - 548

JO - Electronics Letters

JF - Electronics Letters

IS - 6

ER -

Decoding algorithm for DEC RS codes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this