Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials (Q4857490)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 821770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials |
scientific article; zbMATH DE number 821770 |
Statements
Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials (English)
0 references
15 April 1996
0 references
Welch-Berlekamp equation
0 references
decoding of Reed-Solomon codes
0 references
systolic arrays
0 references
0.8311954140663147
0 references
0.8231149315834045
0 references
0.8060706257820129
0 references
