Fixed broken doctests

src/doc/en/thematic_tutorials/coding_theory.rst

@@ -297,7 +297,7 @@ Let us see how one can explore this::
 
     sage: C = codes.GeneralizedReedSolomonCode(GF(59).list()[:40], 12, GF(59).list()[1:41])
     sage: C.encoders_available()
-    ['EvaluationPolynomial', 'EvaluationVector', 'ParityCheck']
+    ['EvaluationPolynomial', 'EvaluationVector']
     sage: C.decoders_available()
     ['Syndrome',
      'NearestNeighbor',

src/sage/coding/linear_code.py

@@ -1910,7 +1910,7 @@ def encode(self, word, encoder_name=None, **kwargs):
         It is possible to manually choose the encoder amongst the list of the available ones::
 
             sage: C.encoders_available()
-            ['GeneratorMatrix', 'ParityCheck']
+            ['GeneratorMatrix']
             sage: word = vector((0, 1, 1, 0))
             sage: C.encode(word, 'GeneratorMatrix')
             (1, 1, 0, 0, 1, 1, 0)
@@ -1963,7 +1963,7 @@ def encoder(self, encoder_name=None, **kwargs):
         an exception will be raised::
 
             sage: C.encoders_available()
-            ['GeneratorMatrix', 'ParityCheck']
+            ['GeneratorMatrix']
             sage: C.encoder('NonExistingEncoder')
             Traceback (most recent call last):
             ...
@@ -1992,11 +1992,10 @@ def encoders_available(self, classes=False):
             sage: G = Matrix(GF(2), [[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.encoders_available()
-            ['GeneratorMatrix', 'ParityCheck']
+            ['GeneratorMatrix']
 
             sage: C.encoders_available(True)
-            {'GeneratorMatrix': <class 'sage.coding.linear_code.LinearCodeGeneratorMatrixEncoder'>,
-            'ParityCheck': <class 'sage.coding.linear_code.LinearCodeParityCheckEncoder'>}
+            {'GeneratorMatrix': <class 'sage.coding.linear_code.LinearCodeGeneratorMatrixEncoder'>}
         """
         if classes == True:
             return copy(self._registered_encoders)