Comparison of two algorithms for decoding alternant codes (Q1277244): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Q914784 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Dimitris Voukalis / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002000050103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066186610 / rank | |||
Normal rank | |||
Latest revision as of 03:48, 20 March 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
