New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent

DOI10.1090/S0025-5718-99-01168-0zbMath0983.11070OpenAlexW2094836964MaRDI QIDQ4942791

Toshihiro Kumada, Yoshiharu Kurita, Hannes Leeb, Makoto Matsumoto

Publication date: 15 March 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01168-0

zbMATH Keywords

Mersenne exponentprimitive \(t\)-nomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to number theory (11-04) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (3)

A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ A primitive trinomial of degree 6972593 ⋮ Ten new primitive binary trinomials

Uses Software

• MersenneTwister

Cites Work

• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• Discrepancy estimates for a class of normal numbers
• Mersenne twister
• Unnamed Item
• Unnamed Item

This page was built for publication: New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent