matlab gftuple,使用MATLAB的有限域计算

Galois Field Computation in MATLAB:

Primitive Polynomial:

An Irreducible polynomial p(X) of degree m is said to be primitive if the smaller positive integer n for which p(X) divides X n + 1 is n = 2m – 1. For example, p(X) = X4 + X + 1 divides X15 +1 but not divides any X n +1 for 1 ≤ n < 15.

In Matlab you can easily find the primitive polynomials for any degree using primpoly(m) function.

Example:

m= 4; Define m = 4 for GF(24)

s = primpoly(m)

Output is:

Primitive polynomial(s) =

D^4+D^1+1

s =

19

Here it shows the primitive polynomial and an integer whose binary representation indicates the coefficients of the polynomial. Note that there could be more than one primitive polynomial for a particular degree of m.

Galois Field arithmetic:

To demonstrate Galois Field arithmetic we consider following table for degree m = 4 an primitive polynomial p(X) = 1 + X + X4

Power Representation Polynomial Represent4-Tuple Representation

0 0 0 0 0 0

1 1 1 0 0 0

αα0 1 0 0

α2 α20 0 1 0

α3 α30 0 0 1

α4 1+ α 1 1 0 0

α5 α + α2 0 1 1 0

α6 α2 + α30 0 1 1

α7 1+ α + α3 1 1 0 1

α8 1 + α2 1 0 1 0

α9 α + α30 1 0 1

α10 1+ α + α2 1 1 1 0