A geometric approach to root finding in GT(q/sup m/)

DOI10.1109/18.32139zbMath0681.12008OpenAlexW2033111719MaRDI QIDQ4729880

Scott A. Vanstone, Paul C. van Oorschot

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.32139

zbMATH Keywords

algorithmsroots of polynomials over the finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (11)

Univariate polynomial factorization over finite fields ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Optimal and pessimal orderings of Steiner triple systems in disk arrays. ⋮ On splitting sets in block designs and finding roots of polynomials ⋮ Ladder orderings of pairs and RAID performance. ⋮ Factoring polynomials over finite fields: A survey ⋮ A case study for constrained learning neural root finders ⋮ Characterization for a family of infinitely many irreducible equally spaced polynomials ⋮ Dilation method for finding close roots of polynomials based on constrained learning neural networks ⋮ Deterministic root finding in finite fields ⋮ Finding roots in with the successive resultants algorithm

This page was built for publication: A geometric approach to root finding in GT(q/sup m/)