方法很简单,以有限域GF(2^4)为例:
>> a=[2 1 2 4;1 0 0 0;0 1 0 0;0 0 1 0];
>> b=gf(a,4) %代表有限域GF(2^4)
b = GF(2^4) array. Primitive polynomial = D^4+D+1 (19 decimal)
Array elements =
2 1 2 4
1 0 0 0
0 1 0 0
0 0 1 0
>> c=b*b*b*b %此时b为有限域上的乘法
c = GF(2^4) array. Primitive polynomial = D^4+D+1 (19 decimal)
Array elements =
2 8 0 14
10 5 2 7
5 0 0 8
2 1 2 4
>> d=inv(c) %inc为求解逆矩阵函数
d = GF(2^4) array. Primitive polynomial = D^4+D+1 (19 decimal)
Array elements =
13 9 13 9
15 0 6 0
0 15 0 6
8 3 7 3