On computing the canonical form for a binary form of odd degree (Q1825177)
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: On computing the canonical form for a binary form of odd degree |
scientific article; zbMATH DE number 4120119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the canonical form for a binary form of odd degree |
scientific article; zbMATH DE number 4120119 |
Statements
On computing the canonical form for a binary form of odd degree (English)
0 references
1989
0 references
The author gives a new algorithm for determining the canonical form of a binary form of odd degree. The algorithm is based on Berlekamp's algorithm for decoding Reed-Solomon codes. Furthermore the author gives three examples illustrating the performance of the algorithm.
0 references
canonical form of a binary form of odd degree
0 references
Berlekamp's algorithm
0 references
decoding Reed-Solomon codes
0 references
