Small changes to doctests

Author: David Lucas

src/sage/coding/code_constructions.py

@@ -935,15 +935,15 @@ def LinearCodeFromCheckMatrix(H):
         [0 1 1 0 0 1 1]
         [0 0 0 1 1 1 1]
         sage: Gh = codes.LinearCodeFromCheckMatrix(H).generator_matrix()
-        sage: Gc = C.generator_matrix().echelon_form()
+        sage: Gc = C.generator_matrix_systematic()
         sage: Gh == Gc
         True
         sage: C = codes.HammingCode(GF(3), 2)
         sage: H = C.parity_check_matrix(); H
         [1 0 1 1]
         [0 1 1 2]
         sage: Gh = codes.LinearCodeFromCheckMatrix(H).generator_matrix()
-        sage: Gc = C.generator_matrix().echelon_form()
+        sage: Gc = C.generator_matrix_systematic()
         sage: Gh == Gc
         True
         sage: C = codes.RandomLinearCode(10,5,GF(4,"a"))

src/sage/coding/linear_code.py

@@ -1885,12 +1885,6 @@ def __eq__(self, right):
             sage: C2 = codes.HammingCode(GF(2), 3)
             sage: C1 == C2
             True
-            sage: C2 = C1.extended_code()
-            sage: C3 = C2.punctured([7])
-            sage: G1 = C1.generator_matrix().echelon_form()
-            sage: G3 = C3.generator_matrix().echelon_form()
-            sage: G1 == G3
-            True
 
         TESTS:
 
@@ -2905,7 +2899,7 @@ def permuted_code(self, p):
             sage: Cg = C.permuted_code(g)
             sage: Cg
             Linear code of length 7, dimension 4 over Finite Field of size 2
-            sage: C.generator_matrix() == Cg.generator_matrix().echelon_form()
+            sage: C.generator_matrix() == Cg.generator_matrix_systematic()
             True
         """
         F = self.base_ring()