Companion matrix and recognition of primitive polynomial

DOI10.1080/09720529.2013.867636MaRDI QIDQ2831805zbMATH OpenOpenAlexFDO

Authors Chang-Wen Peng, Huawei Huang

Publication date 3 November 2016

Published in Journal of Discrete Mathematical Sciences \& Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2013.867636

zbMATH Keywords

algorithmscompanion matrixcomputational complexityfinite fieldprimitive polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Recommendations

• Fast algorithm for finding primitive polynomials over GF(q)
• A characterization of primitive polynomials over finite fields.
• scientific article; zbMATH DE number 19988
• scientific article; zbMATH DE number 872088
• Primitive Polynomials Over Finite Fields

Cites work

• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• On finding primitive roots in finite fields
• Primitive polynomials testing methodology

Cited in

(4)

• The relation between the companion matrix and the companion polynomial in \(\mathbb {R}^4\) algebras
• Minimal height companion matrices for Euclid polynomials
• Generalized cyclotomic numbers and cyclic codes of prime power length over \(\mathbb Z_4\)
• Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields

This page was built for publication: Companion matrix and recognition of primitive polynomial

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