On xn + x + 1 over GF(2)

DOI10.1016/S0019-9958(70)90264-0zbMath0205.35503MaRDI QIDQ5605314

Neal Zierler

Publication date: 1970

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (13)

Fractional dimension of binary Knuth semifield planes ⋮ A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ Irreducible factors of psi-polynomials over finite fields ⋮ Periods of some nonlinear shift registers ⋮ On the regularity of certain 1-additive sequences ⋮ Irreducible trinomials over finite fields ⋮ A concrete matrix field description of some Galois fields. ⋮ Swan's theorem for binary tetranomials ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ Unnamed Item ⋮ Maximum-length sequences, cellular automata, and random numbers ⋮ On Mersenne polynomials over \(\mathbb{F}_2\)

This page was built for publication: On xn + x + 1 over GF(2)