On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.) (Q3772131)
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 4031577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.) |
scientific article; zbMATH DE number 4031577 |
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
0.8803390264511108
0 references
0.8803390264511108
0 references
0.8060110807418823
0 references
0.8049625754356384
0 references
0.8003184795379639
0 references
