On computing the canonical form for a binary form of odd degree
type: Item
instance of: scholarly article
title: On computing the canonical form for a binary form of odd degree
zbMATH Open document ID: 0683.94011
DOI: 10.1016/S0747-7171(89)80034-3
author: Arne Dür
published in: Journal of Symbolic Computation
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 11E99
Mathematics Subject Classification ID: 15A63
zbMATH DE Number: 4120119
zbMATH Keywords: canonical form of a binary form of odd degree
zbMATH Keywords: Berlekamp's algorithm
zbMATH Keywords: decoding Reed-Solomon codes
reviewed by: Herman J. Tiersma
MaRDI profile type: Publication
cites work: Algebraic coding theory
cites work: Q5336331
cites work: Gundelfinger's Theorem on Binary Forms
cites work: Q3791275
cites work: The invariant theory of binary forms
cites work: Q3772229
cites work: On symmetric operators of higher degree and their applications
description: scientific article; zbMATH DE number 4120119