Irreducible polynomials and linear recurring arrays

DOI10.1016/S0166-218X(96)00112-6zbMATH Open0873.11065OpenAlexW2044508103MaRDI QIDQ678874FDOQ678874

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structure and properties of linear recurring m-arrays
• Title not available (Why is that?)

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)