Fast algorithm for finding primitive polynomials over GF(q)

DOI10.1049/EL:19920073MaRDI QIDQ4006408zbMATH OpenOpenAlexFDO

Authors Adina di Porto, F. Guida, Emilio Montolivo

Publication date 26 September 1992

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19920073

zbMATH Keywords

Berlekamp-Massey algorithmfinite fieldsprimitive polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• A fast algorithm to compute irreducible and primitive polynomials in finite fields
• Finding irreducible and primitive polynomials
• Search of primitive polynomials over finite fields

Cited in

(8)

• A note on the multiple-recursive matrix method for generating pseudorandom vectors
• Companion matrix and recognition of primitive polynomial
• A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation
• scientific article; zbMATH DE number 177888 (Why is no real title available?)
• A fast algorithm to compute irreducible and primitive polynomials in finite fields
• A geometric approach to root finding in GT(q/sup m/)
• scientific article; zbMATH DE number 890833 (Why is no real title available?)
• Search of primitive polynomials over finite fields

This page was built for publication: Fast algorithm for finding primitive polynomials over GF(q)

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