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
| dc.creator | Lopez-Ruiz, Ricardo | |
| dc.date | 2004-01-10 | |
| dc.date.accessioned | 2026-07-07T05:35:16Z | |
| dc.date.available | 2026-07-07T05:35:16Z | |
| dc.description | 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. | |
| dc.description | 22 pages, 6 tables, 0 figures | |
| dc.identifier | https://arxiv.org/abs/nlin/0401011 | |
| dc.identifier | http://arxiv.org/abs/nlin/0401011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/80643 | |
| dc.subject | Chaotic Dynamics | |
| dc.subject | General Mathematics | |
| dc.title | 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 | |
| dc.type | text |