Primitive trinomials whose degree is a Mersenne exponent
From MaRDI portal
Publication:5580403
DOI10.1016/S0019-9958(69)90631-7zbMATH Open0186.37002MaRDI QIDQ5580403FDOQ5580403
Authors: Neal Zierler 
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Cited In (9)
- On the Use of Reducible Polynomials as Random Number Generators
- Irreducible factors of psi-polynomials over finite fields
- A comparative study of some pseudorandom number generators
- Reduction-free multiplication for finite fields and polynomial rings
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- A special-purpose processor for the Monte Carlo simulation of Ising spin systems
- A fast processor for Monte-Carlo simulation
- A universal GFSR random number generator for personal computers
- On the Periods of Generalized Fibonacci Recurrences
This page was built for publication: Primitive trinomials whose degree is a Mersenne exponent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580403)
