On computing the canonical form for a binary form of odd degree

DOI10.1016/S0747-7171(89)80034-3zbMath0683.94011MaRDI QIDQ1825177

Arne Dür

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

decoding Reed-Solomon codesBerlekamp's algorithmcanonical form of a binary form of odd degree

Mathematics Subject Classification ID

Quadratic and bilinear forms, inner products (15A63) Decoding (94B35) Forms and linear algebraic groups (11E99)

Related Items

Waring's problem for binary forms, A nearly optimal algorithm to decompose binary forms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On symmetric operators of higher degree and their applications
• The invariant theory of binary forms
• Gundelfinger's Theorem on Binary Forms