The Euclidean algorithm and primitive polynomials over finite fields

DOI10.1007/3-540-46796-3_46MaRDI QIDQ4502655zbMATH OpenFDO

Authors James W. Bond, Stefen Hui, Hank Schmidt

Publication date 12 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46796-3_46

zbMATH Keywords

Euclidean algorithmfinite fieldslow-density parity-check codesprimitive polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• A characterization of primitive polynomials over finite fields.
• Analysis of Euclidean algorithms for polynomials over finite fields
• Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
• A modification of Fitzgerald's characterization of primitive polynomials over a finite field
• scientific article; zbMATH DE number 4027620

Cited in

(9)

• Algorithm for studying polynomial maps and reductions modulo prime number
• Fine costs for Euclid's algorithm on polynomials and Farey maps
• scientific article; zbMATH DE number 6693374 (Why is no real title available?)
• The Euclidean algorithm in quintic and septic cyclic fields
• The exact length of the Euclidean algorithm in [ X ]
• The Euclidean Algorithm in Cubic Number Fields
• Variation on Euclid's algorithm for polynomials
• Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
• Euclidean polynomials for certain arithmetic progressions and the multiplicative group of 𝔽p2

This page was built for publication: The Euclidean algorithm and primitive polynomials over finite fields

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