trac #19251: A real matrix as LinearCode.basis()

Author: nathanncohen

src/sage/coding/linear_code.py

@@ -92,10 +92,10 @@
     sage: G = MS([[1,1,1,0,0,0,0], [1,0,0,1,1,0,0], [0,1,0,1,0,1,0], [1,1,0,1,0,0,1]])
     sage: C = LinearCode(G)
     sage: C.basis()
-    [(1, 1, 1, 0, 0, 0, 0),
-     (1, 0, 0, 1, 1, 0, 0),
-     (0, 1, 0, 1, 0, 1, 0),
-     (1, 1, 0, 1, 0, 0, 1)]
+    [1 1 1 0 0 0 0]
+    [1 0 0 1 1 0 0]
+    [0 1 0 1 0 1 0]
+    [1 1 0 1 0 0 1]
     sage: c = C.basis()[1]
     sage: c in C
     True
@@ -1036,9 +1036,12 @@ def basis(self):
 
             sage: C = codes.HammingCode(3, GF(2))
             sage: C.basis()
-            [(1, 0, 0, 0, 0, 1, 1), (0, 1, 0, 0, 1, 0, 1), (0, 0, 1, 0, 1, 1, 0), (0, 0, 0, 1, 1, 1, 1)]
+            [1 0 0 0 0 1 1]
+            [0 1 0 0 1 0 1]
+            [0 0 1 0 1 1 0]
+            [0 0 0 1 1 1 1]
         """
-        return self.gens()
+        return self.generator_matrix()
 
     # S. Pancratz, 19 Jan 2010:  In the doctests below, I removed the example
     # ``C.binomial_moment(3)``, which was also marked as ``#long``.  This way,
@@ -3317,9 +3320,9 @@ def __init__(self, generator_matrix, d=None):
             ....:             [a, a + 1, 1, a + 1, 1, 0, 0]])
             sage: C = LinearCode(G)
             sage: C.basis()
-            [(1, 0, 0, a + 1, 0, 1, 0),
-             (0, 1, 0, 0, a + 1, 0, 1),
-             (0, 0, 1, a, a + 1, a, a + 1)]
+            [    1     0     0 a + 1     0     1     0]
+            [    0     1     0     0 a + 1     0     1]
+            [    0     0     1     a a + 1     a a + 1]
             sage: C.minimum_distance()
             3