Primitive Trinomials of High Degree

DOI10.2307/2004585zbMath0175.03902OpenAlexW4230252392MaRDI QIDQ5563447

Howard jun. Rumsey, Eugène Rodemich

Publication date: 1968

Full work available at URL: https://doi.org/10.2307/2004585

zbMATH Keywords

commutative algebra

Related Items (4)

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 ⋮ The Fast Fourier Transform in a Finite Field ⋮ On the Periods of Generalized Fibonacci Recurrences

Cites Work

• Unnamed Item
• Factorization of polynomials over finite fields
• Primitive Polynomials (Mod 2)
• Random Numbers Generated by Linear Recurrence Modulo Two

This page was built for publication: Primitive Trinomials of High Degree