An approach to the problem of generating irreducible polynomials over the finite field GF(2) and its relationship with the problem of periodicity on the space of binary sequences
Ricardo Lopez-Ruiz
Abstract
A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the splitting field GF(2n) . Also, the choice of a primitive normal basis allows us to build up a natural representation of GF(2n) in the space of n-binary sequences. Illustrative examples are given for the lowest orders.
Create a lesson
Related papers
Experimental detection of energy transfer into the antiphase mode in a branched double pendulum
Yusuke Toda, Takeshi Ooshida
Trigonometric Nosé--Hoover oscillator: chaos, periodic orbits and integrability
Wojciech Szumiński, Jaume Llibre
Ladder of information limits on prediction for reduced-order models
Adrian Lozano-Duran
A New Route to Chaos through the Geometric Composition of Non-Normal Amplification
D. Sornette, V. R. Saiprasad, V. Troude
Dynamics, periodic orbits and C1 non-integrability of the ABC flow
Wojciech Szumiński, Jaume Llibre
Requirement-Induced Predictive Geometry for Finite-Resource Prediction in Dynamical Systems
Song-Ju Kim