-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathZ2_linear_algebra.py
62 lines (58 loc) · 2.23 KB
/
Z2_linear_algebra.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
class Z2Array:
def __init__(self, m, values):
self.n = len(values)
self.m = m
self.values = values
def is_invertible(self):
if self.m != self.n:
raise Exception
else:
list_2_pow = [1]
for k in range(1, self.n):
list_2_pow.append(list_2_pow[-1] * 2)
for i in range(0, self.n):
j_0 = -1
for j in range(i, self.n):
if (self.values[j] | list_2_pow[i]) == self.values[j]:
j_0 = j
break
if j_0 == -1:
return False
else:
(self.values[i], self.values[j_0]) = (self.values[j_0], self.values[i])
for j in range(i + 1, self.n):
if (self.values[j] | list_2_pow[i]) == self.values[j]:
self.values[j] = self.values[j] ^ self.values[i]
for a in self.values:
if a == 0:
return False
return True
def Z2_rank(self):
list_2_pow = [1]
for k in range(1, self.m):
list_2_pow.append(list_2_pow[-1] * 2)
i = 0
j = 0
while i < self.n and j < self.m:
j_0 = -1
for j_ind in range(i, self.m):
if (self.values[i] | list_2_pow[j_ind]) == self.values[i]:
j_0 = j_ind
break
if j_0 == -1:
i += 1
continue
else:
for l in range(self.n):
if (self.values[l] | list_2_pow[j_0] == self.values[l]) ^ (
self.values[l] | list_2_pow[i] == self.values[l]):
self.values[l] ^= list_2_pow[i]
self.values[l] ^= list_2_pow[j_0]
for j_ind in range(i + 1, self.m):
if (self.values[i] | list_2_pow[j_ind]) == self.values[i]:
for l in range(self.n):
if (self.values[l] | list_2_pow[i] == self.values[l]):
self.values[l] ^= list_2_pow[i]
i += 1
j += 1
return j