Irreducible polynomials and linear recurring arrays

DOI10.1016/S0166-218X(96)00112-6MaRDI QIDQ678874zbMATH OpenOpenAlexFDO

Authors Gary L. Mullen, Mu-Lan Liu

Publication date 12 June 1997

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

discrete logarithm problemprimitive polynomialirreducible polynomiallinear recurring arrays

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• The explicit construction of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 3955054
• The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
• scientific article; zbMATH DE number 3918501

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3956969 (Why is no real title available?)
• scientific article; zbMATH DE number 270250 (Why is no real title available?)
• scientific article; zbMATH DE number 3349977 (Why is no real title available?)
• Structure and properties of linear recurring m-arrays

Cited in

(1)

• Irreducible polynomials and barker sequences

This page was built for publication: Irreducible polynomials and linear recurring arrays

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