Re: Primitive polynomials over GF(2^m)
- From: Derek Holt <mareg@xxxxxxxxxxxxx>
- Date: Thu, 01 Nov 2007 10:29:56 -0700
Timothy Murphy wrote:
Derek Holt wrote:
...A primitive polynomial is an irreducible polynomial of degree m with
the added constraint that the smallest integer n for which P(x)
divides X^n + 1 is n = 2^m - 1. ..(1)
I don't agree! The usual definition is that a primitive polynomial is
one whose roots are generators of the multiplicative group of the
extension field, and the definition given above is equivalent to that.
Except it should be x^n - 1, I guess ...
Same thing in characteristic 2, but I agree it would be preferable to
write x^n-1.
Derek Holt.
.
- Follow-Ups:
- Re: Primitive polynomials over GF(2^m)
- From: Timothy Murphy
- Re: Primitive polynomials over GF(2^m)
- References:
- Primitive polynomials over GF(2^m)
- From: jia
- Re: Primitive polynomials over GF(2^m)
- From: hagman
- Re: Primitive polynomials over GF(2^m)
- From: Derek Holt
- Re: Primitive polynomials over GF(2^m)
- From: Timothy Murphy
- Primitive polynomials over GF(2^m)
- Prev by Date: Re: Probability of elements from Gaussian/normal PDF overlapping?
- Next by Date: Re: Implementable Set Theory and Consistency of ZFC
- Previous by thread: Re: Primitive polynomials over GF(2^m)
- Next by thread: Re: Primitive polynomials over GF(2^m)
- Index(es):
Relevant Pages
|
