Primitive Trinomials of High Degree

DOI10.2307/2004585zbMATH Open0175.03902OpenAlexW4230252392MaRDI QIDQ5563447FDOQ5563447

Howard jun. Rumsey, Eugène Rodemich

Publication date: 1968

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

zbMATH Keywords

commutative algebra

Cites Work

• Title not available (Why is that?)
• Factorization of polynomials over finite fields
• Random Numbers Generated by Linear Recurrence Modulo Two
• Primitive Polynomials (Mod 2)

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563447)