scientific article; zbMATH DE number 872088

zbMATH Open0861.11066MaRDI QIDQ4875297FDOQ4875297

Authors: Miodrag Živković 

Publication date: 12 May 1997

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

algorithmprimitive polynomialsbinary linear recurrent sequences

Mathematics Subject Classification ID

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

Cited In (9)

• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• Code Generation for Polynomial Multiplication
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• A Table of Primitive Binary Polynomials
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• Primitive polynomials over composite Galois fields
• Title not available (Why is that?)
• A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation
• On Using Prime Polynomials in Crypto Generators

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)