Using Tschirnhaus transformations to find roots in quintic polynomials over F₂^m

DOI10.69763/POLYJMATH.2.2MaRDI QIDQ7310024zbMATH OpenFDO

Authors Peter Beelen, Emil Astrup Wrisberg

Publication date 5 August 2026

Published in Polynesian Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.69763/POLYJMATH.2.2

Mathematics Subject Classification ID

Computational number theory (11Yxx) General field theory (12Exx) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites work

• A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes
• A method for removing all intermediate terms from a given equation
• Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(2⁴)
• Efficient computation of roots in finite fields
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
• Formulas for the solutions of quadratic equations over<tex>GF(2^m)</tex>(Corresp.)
• On \(x^{q+1}+ax+b\)
• On the solution of algebraic equations over finite fields
• Taking roots over high extensions of finite fields

This page was built for publication: Using Tschirnhaus transformations to find roots in quintic polynomials over \(\mathbb{F}_{2^{m}}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310024)