On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.) (Q3772131): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.) |
scientific article |
Statements
On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.) (English)
0 references
1987
0 references
decoding algorithms
0 references
Berlekamp iterative algorithm
0 references
decoding of BCH codes
0 references
Euclid algorithm
0 references
greatest common divisor of polynomials
0 references
