2020
DOI: 10.1109/tc.2019.2963827
|View full text |Cite
|
Sign up to set email alerts
|

Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Yu et al [66] proposed the scheme which shows a rapid RS encoding using four to seven equality pictures. First, they demonstrated that it is possible to solve the RS code disorder using the RM change.…”
Section: Parallel Computing Accelerates Selectionmentioning
confidence: 99%
“…Yu et al [66] proposed the scheme which shows a rapid RS encoding using four to seven equality pictures. First, they demonstrated that it is possible to solve the RS code disorder using the RM change.…”
Section: Parallel Computing Accelerates Selectionmentioning
confidence: 99%
“…An efficient partial decoding algorithm for an m-interleaved RS is proposed in [13]. Reference [14] describes a fast RS encoding algorithm with four to seven parity symbols.…”
Section: Introductionmentioning
confidence: 99%