Friday, September 9, 2016

finite fields - Construction of addition and multiplication table for GF(4)

I am dealing with finite fields and somehow got stuck. The construction of a prime field GF(p),pP is pretty easy because every operation is modulo p. In other words GF(p) contains all integers ranging from 0 to p1.


However, non prime fields are a bit trickier. Given the power q=pn with pP and nN, one has to find an irreducable polynom g(x) of degree n. Then the construction of GF(pn) is the following:


GF(pn)=GF(p)[x]g


Theoretically I get along with this definition. Unfortunately I fail to construct addition and multiplication tables for any GF(q). Though I can easily find the wanted table on the internet, I have not found an explication yet that really made me understand.


I would like to know how to create the addition and multiplication table for GF(22) with the above knowledge. GF(22) contains four elements. Let's call them {0,1,α,β}. g must be x2+x+1 as there no other irreducable polynom of degree 2. So far I am able to construct the addition table partly (question marks indicating despair...):


| + | 0 1 α β |


0 | 0 1 α β |



1 | 1 0 ? ? |


α | α ? ? ? |


β | β ? ? ? |


I don't understand how to calculate for example 1+α. The result is β, but I don't know why. Concerning the above short explanation, I have to divide 1+α by g. But how can I do this?


Thanks for your help

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...