Erasure decoding of five times extended Reed-Solomon codes

Rakús, Martin; Farkas, Peter; Palenik, Tomas

doi:10.2478/jee-2019-0035

Cited by 4 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• more than two errors in information symbol: In this case the complexity of procedures quantified by Υ 1I , Υ 2I , Υ 1P 1I can be added as the worst case: (16,6,23,9,2). (106)…”

Section: Complexity Estimation Of the Algorithmmentioning

confidence: 99%

“…In [1] it was shown that RS codes could be extended not only three times, but even five times when they are constructed over certain finite fields. For such five times extended RS codes a decoding algorithm is known [2] which is suitable only for erasure decoding. In case of erasures the positions are known in a received vector and therefore only the erasure values have to be found out during decoding.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Decoding Five Times Extended Reed Solomon Codes Using Syndromes

Farkas

Rakús

2020

cai

Self Cite

View full text Add to dashboard Cite

Recently a new family of five times extended Reed Solomon codes constructed over certain finite fields GF (2 ζ ), where ζ ≥ 3 is an odd integer, was discovered. Until now only an erasure decoding algorithm for these codes was published. In this paper a new decoding algorithm is presented, which allows correcting up to two errors in a codeword from the five times extended Reed Solomon codes. The proposed decoding algorithm is based on syndrome usage.

show abstract

“…• more than two errors in information symbol: In this case the complexity of procedures quantified by Υ 1I , Υ 2I , Υ 1P 1I can be added as the worst case: (16,6,23,9,2). (106)…”

Section: Complexity Estimation Of the Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%