2020
DOI: 10.31577/cai_2020_6_1311
|View full text |Cite
|
Sign up to set email alerts
|

Decoding Five Times Extended Reed Solomon Codes Using Syndromes

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
(40 reference statements)
0
1
0
Order By: Relevance
“…For example in [59] the author proposed one related approach how to obtain RLL-ECCs from Reed Solomon (RS) using modifiers. However, its application to RS codes specified by CCSDS did not bring a significant decrease of RL M AX .…”
Section: Discussionmentioning
confidence: 99%
“…For example in [59] the author proposed one related approach how to obtain RLL-ECCs from Reed Solomon (RS) using modifiers. However, its application to RS codes specified by CCSDS did not bring a significant decrease of RL M AX .…”
Section: Discussionmentioning
confidence: 99%