Ten new primitive binary trinomials
From MaRDI portal
Recommendations
- New primitive t-nomials (t = 3,5) over GF(2) whose degree is a Mersenne exponent
- Table of Primitive Binary Polynomials. II
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- The great trinomial hunt
Cites work
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- A primitive trinomial of degree 6972593
- Factorization of polynomials over finite fields
- Faster Multiplication in GF(2)[x]
- scientific article; zbMATH DE number 5575550 (Why is no real title available?)
- New primitive t-nomials (t = 3,5) over GF(2) whose degree is a Mersenne exponent
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
Cited in
(11)- A note on the multiple-recursive matrix method for generating pseudorandom vectors
- On Mersenne polynomials over \(\mathbb{F}_2\)
- An update on primitive ternary complementary pairs
- The great trinomial hunt
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
- NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
- A primitive trinomial of degree 6972593
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- The MIXMAX random number generator
- Swan-like results for binomials and trinomials over finite fields of odd characteristic
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
This page was built for publication: Ten new primitive binary trinomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055140)