Re: Primitive polynomial over/of GF(p^m)
- From: jaco.versfeld@xxxxxxxxx
- Date: Thu, 01 Nov 2007 07:04:46 -0000
Hi Jia,
However, there is no definition about primitive polynomial over the
extension of GF(2) in that book. I saw you gave a definition "a
irreducible polynomial over GF(2^m), if the smallest integer n for
which P(x) divides X^n + 1 is n = 2^m - 1", which is similar to the
definition over GF(2).
Are you sure about the definition of the primitive polynomial over
GF(2^m)?
Unfortunately, I am not sure about this definition. I double checked
with another text (Fundamentals of Error-Correcting Codes, Huffman and
Pless), which gave the same definition as Lin and Costello, again only
for GF(2). I think that when we move to extension fields (GF(2^m)),
we define and work with minimal polynomials.
Sorry, I got a bit rusty on the coding.
The guys at sci.math might be able to help as well.
Hope this helps a bit
Jaco
.
- Follow-Ups:
- Re: Primitive polynomial over/of GF(p^m)
- From: jaco . versfeld
- Re: Primitive polynomial over/of GF(p^m)
- References:
- Re: Primitive polynomial over/of GF(p^m)
- From: jia
- Re: Primitive polynomial over/of GF(p^m)
- Prev by Date: Re: Primitive polynomial over/of GF(p^m)
- Next by Date: Re: Primitive polynomial over/of GF(p^m)
- Previous by thread: Re: Primitive polynomial over/of GF(p^m)
- Next by thread: Re: Primitive polynomial over/of GF(p^m)
- Index(es):
Relevant Pages
|