scientific article; zbMATH DE number 872088

MaRDI QIDQ4875297zbMATH OpenFDO

Authors Miodrag Živković

Publication date 12 May 1997

zbMATH Keywords

algorithmprimitive polynomialsbinary linear recurrent sequences

Mathematics Subject Classification ID

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

Recommendations

• A Table of Primitive Binary Polynomials
• Table of Primitive Binary Polynomials. II
• Primitive Normal Polynomials Over Finite Fields

Cited in

(11)

• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• On Using Prime Polynomials in Crypto Generators
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• (Imperfect) strategies to generate primitive polynomials over GF(2)
• A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation
• Companion matrix and recognition of primitive polynomial
• Primitive polynomials over composite Galois fields
• scientific article; zbMATH DE number 4127347 (Why is no real title available?)
• Code Generation for Polynomial Multiplication
• A Table of Primitive Binary Polynomials
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377

This page was built for publication:

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