Abstract
For an even positive integer n, formulas were determined for the number of irreducible polynomials of degree n over GF(2) in which the coefficients of xn-1, xn-2 and xn-3 were specified in advance. GF(2)[x] was used to denote the ring of all polynomials with coefficients in GF(2). Formulas for the number of elements in GF(2n) with the first three traces specified were also given.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 265-279 |
| Number of pages | 15 |
| Journal | Discrete Mathematics |
| Volume | 274 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Jan 6 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Irreducible polynomials over GF(2) with prescribed coefficients'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver