Primitive trinomials whose degree is a Mersenne exponent
From MaRDI portal
Publication:5580403
DOI10.1016/S0019-9958(69)90631-7zbMath0186.37002MaRDI QIDQ5580403
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items (9)
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ A universal GFSR random number generator for personal computers ⋮ A comparative study of some pseudorandom number generators ⋮ Irreducible factors of psi-polynomials over finite fields ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ On the Use of Reducible Polynomials as Random Number Generators ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ A special-purpose processor for the Monte Carlo simulation of Ising spin systems ⋮ A fast processor for Monte-Carlo simulation
This page was built for publication: Primitive trinomials whose degree is a Mersenne exponent
