added Prange as a sat algorithm

Author: Floyd Zweydinger

decoding/matrix.py

@@ -23,6 +23,7 @@ def __getitem__(self, tup):
 
     def print(self, tranpose: bool = False):
         """ printing """
+        print("nrows:", self.nrows, ", ncols:", self.ncols)
         for i in range(self.nrows):
             for j in range(self.ncols):
                 print(self.data[i][j], end='')
@@ -36,6 +37,26 @@ def zero(self) -> 'Matrix':
                 self.data[i][j] = 0
         return self
 
+    def from_string(self, d: str, transposed: bool = True) -> 'Matrix':
+        """ reads line by line
+        """
+        if transposed:
+            D = Matrix(self.ncols, self.nrows, self.q)
+        else:
+            D = self 
+        for i in range(self.nrows):
+            for j in range(self.ncols):
+                if transposed:
+                    t = int(d[j*self.nrows+ i])
+                    D.data[j][i] = t 
+                else:
+                    t = int(d[i*self.ncols+ j])
+                    D.data[i][j] = t 
+
+        if transposed:
+            self = D.transpose()
+        return self
+        
     def random(self) -> 'Matrix':
         """ generates a random matrix """
         for i in range(self.nrows):

decoding/optimize.py

@@ -412,6 +412,8 @@ def gen_random_instance(self):
         """ creates a random parity check matrix and syndrome. 
         TODO: no guarantee of the existence of a solution is made.
         """
+        self.H = ""
+        self.syndrome = ""
         for _ in range(self.problem.n * (self.problem.n - self.problem.k)):
             self.H += str(random.randint(0, self.problem.q - 1))
         for _ in range(self.problem.n - self.problem.k):