scientific article; zbMATH DE number 872088

MaRDI QIDQ4875297zbMATH OpenFDO

Authors Miodrag Živković

Publication date 12 May 1997

zbMATH Keywords

algorithmbinary linear recurrent sequencesprimitive polynomials

Mathematics Subject Classification ID

Recurrences (11B37) Polynomials over finite fields (11T06) 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

(13)

• (Imperfect) strategies to generate primitive polynomials over GF(2)
• Companion matrix and recognition of primitive polynomial
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• Primitive polynomials over composite Galois fields
• A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation
• Code Generation for Polynomial Multiplication
• The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis
• scientific article; zbMATH DE number 4127347 (Why is no real title available?)
• A Table of Primitive Binary Polynomials
• Table of Primitive Binary Polynomials. II
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• On Using Prime Polynomials in Crypto Generators
• 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)