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

Nonlinear Sciences – Chaotic Dynamics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages, 6 tables, 0 figures

Scientific paper

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(2^n) . Also, the choice of a primitive normal basis allows us to build up a natural representation of GF(2^n) in the space of n-binary sequences. Illustrative examples are given for the lowest orders.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 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, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 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 will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-688761

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.