使用MATLAB的有限域计算.pdfVIP

Galois Field Computation in MATLAB: Primitive Polynomial: An Irreducible polynomial p(X) of degree m is said to be primitive if the n m smaller positive integer n for which p(X) divides X + 1 is n = 2 – 1. For example, p(X) = X4 15 n + X + 1 divides X +1 but not divides any X +1 for 1 ≤ n 15. In Matlab you can easily find the primitive polynomials for any degree using primpoly(m) function. Example: 4 m= 4; Define m = 4 for GF(2 ) 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 Represent 4-Tuple Representation 0 0 0 0 0 0 1 1 1 0 0 0 α α 0 1 0 0 α2 α2 0 0 1 0 α3 α3 0 0 0 1 α4 1+ α 1 1 0 0 α5 α + α2 0 1 1 0 6 2 3 α α + α 0 0 1 1 α7