Deploy d6f6ed3

mhostetter · Oct 25, 2023 · 05b8199 · 05b8199
1 parent 1be6bf3
commit 05b8199
Show file tree

Hide file tree

Showing 131 changed files with 435 additions and 475 deletions.
diff --git a/v0.3.x/.doctrees/api.doctree b/v0.3.x/.doctrees/api.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.__init__.doctree b/v0.3.x/.doctrees/api/galois.BCH.__init__.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.decode.doctree b/v0.3.x/.doctrees/api/galois.BCH.decode.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.detect.doctree b/v0.3.x/.doctrees/api/galois.BCH.detect.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.doctree b/v0.3.x/.doctrees/api/galois.BCH.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.encode.doctree b/v0.3.x/.doctrees/api/galois.BCH.encode.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.extension_field.doctree b/v0.3.x/.doctrees/api/galois.BCH.extension_field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.BCH.field.doctree b/v0.3.x/.doctrees/api/galois.BCH.field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FLFSR.doctree b/v0.3.x/.doctrees/api/galois.FLFSR.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FLFSR.field.doctree b/v0.3.x/.doctrees/api/galois.FLFSR.field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Field.doctree b/v0.3.x/.doctrees/api/galois.Field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.Random.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.Random.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.characteristic_poly.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.characteristic_poly.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.column_space.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.column_space.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.left_null_space.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.left_null_space.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.log.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.log.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.minimal_poly.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.minimal_poly.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.null_space.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.null_space.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.primitive_root_of_unity.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.primitive_root_of_unity.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.primitive_roots_of_unity.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.primitive_roots_of_unity.doctree
diff --git a/v0.3.x/.doctrees/api/galois.FieldArray.row_space.doctree b/v0.3.x/.doctrees/api/galois.FieldArray.row_space.doctree
diff --git a/v0.3.x/.doctrees/api/galois.GF.doctree b/v0.3.x/.doctrees/api/galois.GF.doctree
diff --git a/v0.3.x/.doctrees/api/galois.GLFSR.doctree b/v0.3.x/.doctrees/api/galois.GLFSR.doctree
diff --git a/v0.3.x/.doctrees/api/galois.GLFSR.field.doctree b/v0.3.x/.doctrees/api/galois.GLFSR.field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Degrees.doctree b/v0.3.x/.doctrees/api/galois.Poly.Degrees.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Identity.doctree b/v0.3.x/.doctrees/api/galois.Poly.Identity.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Int.doctree b/v0.3.x/.doctrees/api/galois.Poly.Int.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.One.doctree b/v0.3.x/.doctrees/api/galois.Poly.One.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Random.doctree b/v0.3.x/.doctrees/api/galois.Poly.Random.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Roots.doctree b/v0.3.x/.doctrees/api/galois.Poly.Roots.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Str.doctree b/v0.3.x/.doctrees/api/galois.Poly.Str.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.Zero.doctree b/v0.3.x/.doctrees/api/galois.Poly.Zero.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.__call__.doctree b/v0.3.x/.doctrees/api/galois.Poly.__call__.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.__init__.doctree b/v0.3.x/.doctrees/api/galois.Poly.__init__.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.derivative.doctree b/v0.3.x/.doctrees/api/galois.Poly.derivative.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.doctree b/v0.3.x/.doctrees/api/galois.Poly.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.field.doctree b/v0.3.x/.doctrees/api/galois.Poly.field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.Poly.is_irreducible.doctree b/v0.3.x/.doctrees/api/galois.Poly.is_irreducible.doctree
diff --git a/v0.3.x/.doctrees/api/galois.ReedSolomon.__init__.doctree b/v0.3.x/.doctrees/api/galois.ReedSolomon.__init__.doctree
diff --git a/v0.3.x/.doctrees/api/galois.ReedSolomon.decode.doctree b/v0.3.x/.doctrees/api/galois.ReedSolomon.decode.doctree
diff --git a/v0.3.x/.doctrees/api/galois.ReedSolomon.detect.doctree b/v0.3.x/.doctrees/api/galois.ReedSolomon.detect.doctree
diff --git a/v0.3.x/.doctrees/api/galois.ReedSolomon.doctree b/v0.3.x/.doctrees/api/galois.ReedSolomon.doctree
diff --git a/v0.3.x/.doctrees/api/galois.ReedSolomon.encode.doctree b/v0.3.x/.doctrees/api/galois.ReedSolomon.encode.doctree
diff --git a/v0.3.x/.doctrees/api/galois.ReedSolomon.field.doctree b/v0.3.x/.doctrees/api/galois.ReedSolomon.field.doctree
diff --git a/v0.3.x/.doctrees/api/galois.crt.doctree b/v0.3.x/.doctrees/api/galois.crt.doctree
diff --git a/v0.3.x/.doctrees/api/galois.fermat_primality_test.doctree b/v0.3.x/.doctrees/api/galois.fermat_primality_test.doctree
diff --git a/v0.3.x/.doctrees/api/galois.irreducible_poly.doctree b/v0.3.x/.doctrees/api/galois.irreducible_poly.doctree
diff --git a/v0.3.x/.doctrees/api/galois.irreducible_polys.doctree b/v0.3.x/.doctrees/api/galois.irreducible_polys.doctree
diff --git a/v0.3.x/.doctrees/api/galois.is_cyclic.doctree b/v0.3.x/.doctrees/api/galois.is_cyclic.doctree
diff --git a/v0.3.x/.doctrees/api/galois.lagrange_poly.doctree b/v0.3.x/.doctrees/api/galois.lagrange_poly.doctree
diff --git a/v0.3.x/.doctrees/api/galois.pollard_p1.doctree b/v0.3.x/.doctrees/api/galois.pollard_p1.doctree
diff --git a/v0.3.x/.doctrees/api/galois.primitive_element.doctree b/v0.3.x/.doctrees/api/galois.primitive_element.doctree
diff --git a/v0.3.x/.doctrees/api/galois.primitive_poly.doctree b/v0.3.x/.doctrees/api/galois.primitive_poly.doctree
diff --git a/v0.3.x/.doctrees/api/galois.primitive_polys.doctree b/v0.3.x/.doctrees/api/galois.primitive_polys.doctree
diff --git a/v0.3.x/.doctrees/api/galois.primitive_root.doctree b/v0.3.x/.doctrees/api/galois.primitive_root.doctree
diff --git a/v0.3.x/.doctrees/api/galois.primitive_roots.doctree b/v0.3.x/.doctrees/api/galois.primitive_roots.doctree
diff --git a/v0.3.x/.doctrees/api/galois.prod.doctree b/v0.3.x/.doctrees/api/galois.prod.doctree
diff --git a/v0.3.x/.doctrees/api/galois.random_prime.doctree b/v0.3.x/.doctrees/api/galois.random_prime.doctree
diff --git a/v0.3.x/.doctrees/api/galois.typing.ShapeLike.doctree b/v0.3.x/.doctrees/api/galois.typing.ShapeLike.doctree
diff --git a/v0.3.x/.doctrees/basic-usage/array-creation.doctree b/v0.3.x/.doctrees/basic-usage/array-creation.doctree
diff --git a/v0.3.x/.doctrees/basic-usage/element-representation.doctree b/v0.3.x/.doctrees/basic-usage/element-representation.doctree
diff --git a/v0.3.x/.doctrees/basic-usage/poly.doctree b/v0.3.x/.doctrees/basic-usage/poly.doctree
diff --git a/v0.3.x/.doctrees/development/installation.doctree b/v0.3.x/.doctrees/development/installation.doctree
diff --git a/v0.3.x/.doctrees/development/linter.doctree b/v0.3.x/.doctrees/development/linter.doctree
diff --git a/v0.3.x/.doctrees/environment.pickle b/v0.3.x/.doctrees/environment.pickle
diff --git a/v0.3.x/.doctrees/getting-started.doctree b/v0.3.x/.doctrees/getting-started.doctree
diff --git a/v0.3.x/api/galois.BCH.decode/index.html b/v0.3.x/api/galois.BCH.decode/index.html
@@ -7960,31 +7960,31 @@
 <span class="gp">In [12]: </span><span class="n">GF</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">field</span>
 
 <span class="gp">In [13]: </span><span class="n">m</span> <span class="o">=</span> <span class="n">GF</span><span class="o">.</span><span class="n">Random</span><span class="p">(</span><span class="n">bch</span><span class="o">.</span><span class="n">k</span> <span class="o">-</span> <span class="mi">3</span><span class="p">);</span> <span class="n">m</span>
-<span class="gh">Out[13]: </span><span class="go">GF([1, 0, 1, 1], order=2)</span>
+<span class="gh">Out[13]: </span><span class="go">GF([0, 0, 0, 0], order=2)</span>
 
 <span class="gp">In [14]: </span><span class="n">c</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">m</span><span class="p">);</span> <span class="n">c</span>
-<span class="gh">Out[14]: </span><span class="go">GF([1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], order=2)</span>
+<span class="gh">Out[14]: </span><span class="go">GF([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], order=2)</span>
 </code></pre></div>
 </div>
 <p>Corrupt <span class="math notranslate nohighlight">\(t\)</span> symbols of the codeword.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [15]: </span><span class="n">bch</span><span class="o">.</span><span class="n">t</span>
 <span class="gh">Out[15]: </span><span class="go">2</span>
 
 <span class="gp">In [16]: </span><span class="n">c</span><span class="p">[</span><span class="mi">0</span><span class="p">:</span><span class="n">bch</span><span class="o">.</span><span class="n">t</span><span class="p">]</span> <span class="o">^=</span> <span class="mi">1</span><span class="p">;</span> <span class="n">c</span>
-<span class="gh">Out[16]: </span><span class="go">GF([0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], order=2)</span>
+<span class="gh">Out[16]: </span><span class="go">GF([1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], order=2)</span>
 </code></pre></div>
 </div>
 <p>Decode the codeword and recover the message.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [17]: </span><span class="n">d</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">c</span><span class="p">);</span> <span class="n">d</span>
-<span class="gh">Out[17]: </span><span class="go">GF([1, 0, 1, 1], order=2)</span>
+<span class="gh">Out[17]: </span><span class="go">GF([0, 0, 0, 0], order=2)</span>
 
 <span class="gp">In [18]: </span><span class="n">np</span><span class="o">.</span><span class="n">array_equal</span><span class="p">(</span><span class="n">d</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span>
 <span class="gh">Out[18]: </span><span class="go">True</span>
 </code></pre></div>
 </div>
 <p>Decode the codeword, specifying the number of corrected errors, and recover the message.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [19]: </span><span class="n">d</span><span class="p">,</span> <span class="n">e</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="n">errors</span><span class="o">=</span><span class="kc">True</span><span class="p">);</span> <span class="n">d</span><span class="p">,</span> <span class="n">e</span>
-<span class="gh">Out[19]: </span><span class="go">(GF([1, 0, 1, 1], order=2), 2)</span>
+<span class="gh">Out[19]: </span><span class="go">(GF([0, 0, 0, 0], order=2), 2)</span>
 
 <span class="gp">In [20]: </span><span class="n">np</span><span class="o">.</span><span class="n">array_equal</span><span class="p">(</span><span class="n">d</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span>
 <span class="gh">Out[20]: </span><span class="go">True</span>
@@ -7999,15 +7999,15 @@
 
 <span class="gp">In [23]: </span><span class="n">m</span> <span class="o">=</span> <span class="n">GF</span><span class="o">.</span><span class="n">Random</span><span class="p">((</span><span class="mi">3</span><span class="p">,</span> <span class="n">bch</span><span class="o">.</span><span class="n">k</span><span class="p">));</span> <span class="n">m</span>
 <span class="gh">Out[23]: </span>
-<span class="go">GF([[1, 1, 0, 1, 1, 0, 1],</span>
-<span class="go">    [1, 1, 1, 1, 1, 0, 1],</span>
-<span class="go">    [0, 1, 0, 0, 1, 0, 0]], order=2)</span>
+<span class="go">GF([[0, 1, 0, 1, 0, 0, 0],</span>
+<span class="go">    [1, 1, 1, 0, 0, 1, 0],</span>
+<span class="go">    [0, 0, 0, 1, 0, 1, 1]], order=2)</span>
 
 <span class="gp">In [24]: </span><span class="n">c</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">m</span><span class="p">);</span> <span class="n">c</span>
 <span class="gh">Out[24]: </span>
-<span class="go">GF([[1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0],</span>
-<span class="go">    [1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0],</span>
-<span class="go">    [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0]], order=2)</span>
+<span class="go">GF([[0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1],</span>
+<span class="go">    [1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1],</span>
+<span class="go">    [0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]], order=2)</span>
 </code></pre></div>
 </div>
 <p>Corrupt the codeword. Add zero errors to the first codeword, one to the second, and two to the
@@ -8018,17 +8018,17 @@
 
 <span class="gp">In [27]: </span><span class="n">c</span>
 <span class="gh">Out[27]: </span>
-<span class="go">GF([[1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0],</span>
-<span class="go">    [0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0],</span>
-<span class="go">    [1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0]], order=2)</span>
+<span class="go">GF([[0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1],</span>
+<span class="go">    [0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1],</span>
+<span class="go">    [1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]], order=2)</span>
 </code></pre></div>
 </div>
 <p>Decode the codeword and recover the message.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [28]: </span><span class="n">d</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">c</span><span class="p">);</span> <span class="n">d</span>
 <span class="gh">Out[28]: </span>
-<span class="go">GF([[1, 1, 0, 1, 1, 0, 1],</span>
-<span class="go">    [1, 1, 1, 1, 1, 0, 1],</span>
-<span class="go">    [0, 1, 0, 0, 1, 0, 0]], order=2)</span>
+<span class="go">GF([[0, 1, 0, 1, 0, 0, 0],</span>
+<span class="go">    [1, 1, 1, 0, 0, 1, 0],</span>
+<span class="go">    [0, 0, 0, 1, 0, 1, 1]], order=2)</span>
 
 <span class="gp">In [29]: </span><span class="n">np</span><span class="o">.</span><span class="n">array_equal</span><span class="p">(</span><span class="n">d</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span>
 <span class="gh">Out[29]: </span><span class="go">True</span>
@@ -8037,9 +8037,9 @@
 <p>Decode the codeword, specifying the number of corrected errors, and recover the message.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [30]: </span><span class="n">d</span><span class="p">,</span> <span class="n">e</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="n">errors</span><span class="o">=</span><span class="kc">True</span><span class="p">);</span> <span class="n">d</span><span class="p">,</span> <span class="n">e</span>
 <span class="gh">Out[30]: </span>
-<span class="go">(GF([[1, 1, 0, 1, 1, 0, 1],</span>
-<span class="go">     [1, 1, 1, 1, 1, 0, 1],</span>
-<span class="go">     [0, 1, 0, 0, 1, 0, 0]], order=2),</span>
+<span class="go">(GF([[0, 1, 0, 1, 0, 0, 0],</span>
+<span class="go">     [1, 1, 1, 0, 0, 1, 0],</span>
+<span class="go">     [0, 0, 0, 1, 0, 1, 1]], order=2),</span>
 <span class="go"> array([0, 1, 2]))</span>
 
 <span class="gp">In [31]: </span><span class="n">np</span><span class="o">.</span><span class="n">array_equal</span><span class="p">(</span><span class="n">d</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span>
@@ -8055,15 +8055,15 @@
 
 <span class="gp">In [34]: </span><span class="n">m</span> <span class="o">=</span> <span class="n">GF</span><span class="o">.</span><span class="n">Random</span><span class="p">((</span><span class="mi">3</span><span class="p">,</span> <span class="n">bch</span><span class="o">.</span><span class="n">k</span> <span class="o">-</span> <span class="mi">3</span><span class="p">));</span> <span class="n">m</span>
 <span class="gh">Out[34]: </span>
-<span class="go">GF([[0, 0, 0, 0],</span>
-<span class="go">    [1, 0, 1, 1],</span>
-<span class="go">    [0, 1, 0, 1]], order=2)</span>
+<span class="go">GF([[0, 0, 0, 1],</span>
+<span class="go">    [1, 0, 0, 0],</span>
+<span class="go">    [1, 0, 0, 0]], order=2)</span>
 
 <span class="gp">In [35]: </span><span class="n">c</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="n">m</span><span class="p">);</span> <span class="n">c</span>
 <span class="gh">Out[35]: </span>
-<span class="go">GF([[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],</span>
-<span class="go">    [1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1],</span>
-<span class="go">    [0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1]], order=2)</span>
+<span class="go">GF([[0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1],</span>
+<span class="go">    [1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1],</span>
+<span class="go">    [1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1]], order=2)</span>
 </code></pre></div>
 </div>
 <p>Corrupt the codeword. Add zero errors to the first codeword, one to the second, and two to the
@@ -8074,17 +8074,17 @@
 
 <span class="gp">In [38]: </span><span class="n">c</span>
 <span class="gh">Out[38]: </span>
-<span class="go">GF([[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],</span>
-<span class="go">    [0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1],</span>
-<span class="go">    [1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1]], order=2)</span>
+<span class="go">GF([[0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1],</span>
+<span class="go">    [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1],</span>
+<span class="go">    [0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1]], order=2)</span>
 </code></pre></div>
 </div>
 <p>Decode the codeword and recover the message.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [39]: </span><span class="n">d</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">c</span><span class="p">);</span> <span class="n">d</span>
 <span class="gh">Out[39]: </span>
-<span class="go">GF([[0, 0, 0, 0],</span>
-<span class="go">    [1, 0, 1, 1],</span>
-<span class="go">    [0, 1, 0, 1]], order=2)</span>
+<span class="go">GF([[0, 0, 0, 1],</span>
+<span class="go">    [1, 0, 0, 0],</span>
+<span class="go">    [1, 0, 0, 0]], order=2)</span>
 
 <span class="gp">In [40]: </span><span class="n">np</span><span class="o">.</span><span class="n">array_equal</span><span class="p">(</span><span class="n">d</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span>
 <span class="gh">Out[40]: </span><span class="go">True</span>
@@ -8093,9 +8093,9 @@
 <p>Decode the codeword, specifying the number of corrected errors, and recover the message.</p>
 <div class="highlight-ipython notranslate"><div class="highlight"><pre><span></span><code><span class="gp">In [41]: </span><span class="n">d</span><span class="p">,</span> <span class="n">e</span> <span class="o">=</span> <span class="n">bch</span><span class="o">.</span><span class="n">decode</span><span class="p">(</span><span class="n">c</span><span class="p">,</span> <span class="n">errors</span><span class="o">=</span><span class="kc">True</span><span class="p">);</span> <span class="n">d</span><span class="p">,</span> <span class="n">e</span>
 <span class="gh">Out[41]: </span>
-<span class="go">(GF([[0, 0, 0, 0],</span>
-<span class="go">     [1, 0, 1, 1],</span>
-<span class="go">     [0, 1, 0, 1]], order=2),</span>
+<span class="go">(GF([[0, 0, 0, 1],</span>
+<span class="go">     [1, 0, 0, 0],</span>
+<span class="go">     [1, 0, 0, 0]], order=2),</span>
 <span class="go"> array([0, 1, 2]))</span>
 
 <span class="gp">In [42]: </span><span class="n">np</span><span class="o">.</span><span class="n">array_equal</span><span class="p">(</span><span class="n">d</span><span class="p">,</span> <span class="n">m</span><span class="p">)</span>