Comparison of two algorithms for decoding alternant codes (Q1277244)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of two algorithms for decoding alternant codes |
scientific article; zbMATH DE number 1247993
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of two algorithms for decoding alternant codes |
scientific article; zbMATH DE number 1247993 |
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
