How Do You Compute Minimal and Characteristic Polynomials in F16 Over F2?

sara15
Messages
14
Reaction score
0
Hey guys,

I really need some help please!
I would really appreciate it if anyone can help out,

if we have F16 = F2/(x^4+x+1). can anyone explain to me how can I compute the minimal polynomials and the characteristic polynomils over F2 of elements of F16 and to point out the primitive ones . I have difficulty to understand this question.
Thanks
 
Physics news on Phys.org
OK, here's what you do to find the minimal polynomial. Take an element a in F16. First you need to find a polynomial such that a is a root of the polynomial, then you need to make sure that this polynomial is minimal.

Let me give an example: take x in F16 (where we interpret x as a polynomial).
Since F16=F2[X]/(X^4+X+1), we see that x is a root of the polynomial X^4+X+1. Furthermore, this is the minimal polynomial, since X^4+X+1 is irreducible over F2.

This is how you have to do these kind of things.
By the way, could you say what you mean with characteristic and primitive polynomials? I only know these terms with respect to linear algebra...
 
micromass said:
OK, here's what you do to find the minimal polynomial. Take an element a in F16. First you need to find a polynomial such that a is a root of the polynomial, then you need to make sure that this polynomial is minimal.

Let me give an example: take x in F16 (where we interpret x as a polynomial).
Since F16=F2[X]/(X^4+X+1), we see that x is a root of the polynomial X^4+X+1. Furthermore, this is the minimal polynomial, since X^4+X+1 is irreducible over F2.

This is how you have to do these kind of things.
By the way, could you say what you mean with characteristic and primitive polynomials? I only know these terms with respect to linear algebra...

Thanks for replying to my question. I do not know how to find the characteristic polynomial
by this way (x-alpha)(x-sigma(alpha))...(x-sigma^n-1(alpha)) this is called the characteristic polynomial of alpha over Fq , where alpha is in Fq^n.
and the primitive polynomial is a monic polynomial of degree n over Fq and has a primitive element of Fq^n as one of its roots. The primitive element is an element that has order q-1
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top