Comparison of two algorithms for decoding alternant codes (Q1277244): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587486 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Dimitris Voukalis / rank | |||
Normal rank | |||
Revision as of 09:18, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of two algorithms for decoding alternant codes |
scientific article |
Statements
Comparison of two algorithms for decoding alternant codes (English)
0 references
14 November 1999
0 references
The computational complexity of two algorithms for decoding of a \(t\)-error correcting alternant code is estimated. These codes include BCH, Reed-Solomon, and classical Goppa codes. Also a new improved version of the algorithm is given.
0 references
computational complexity
0 references
decoding algorithms
0 references
error correcting alternant code
0 references
