build based on 7aaa16f

esabo · Mar 1, 2024 · 82c1f4d · 82c1f4d
1 parent 2c709f1
commit 82c1f4d
Show file tree

Hide file tree

Showing 33 changed files with 78 additions and 78 deletions.
diff --git a/dev/Classical/GeneralizedReedSolomon/index.html b/dev/Classical/GeneralizedReedSolomon/index.html
diff --git a/dev/Classical/ReedMuller/index.html b/dev/Classical/ReedMuller/index.html
diff --git a/dev/Classical/concatenation/index.html b/dev/Classical/concatenation/index.html
diff --git a/dev/Classical/cyclic_code/index.html b/dev/Classical/cyclic_code/index.html
diff --git a/dev/Classical/linear_code/index.html b/dev/Classical/linear_code/index.html
diff --git a/dev/Classical/misc_known_codes/index.html b/dev/Classical/misc_known_codes/index.html
diff --git a/dev/Classical/new_codes_from_old/index.html b/dev/Classical/new_codes_from_old/index.html
diff --git a/dev/Classical/product_codes/index.html b/dev/Classical/product_codes/index.html
diff --git a/dev/Classical/quasi-cyclic_code/index.html b/dev/Classical/quasi-cyclic_code/index.html
diff --git a/dev/Examples/Quantum Reed-Muller Codes/index.html b/dev/Examples/Quantum Reed-Muller Codes/index.html
@@ -82,4 +82,4 @@
 		0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 1 &amp; 1 &amp; 0 &amp; 0 &amp; 1 &amp; 1\
 		0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 1 &amp; 1 &amp; 1 &amp; 1\
 		0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 1 &amp; 0 &amp; 1 &amp; 0 &amp; 1 &amp; 0 &amp; 1 	\end{pmatrix}. \end{equation} One may check that <span>$\mathrm{rowspace}(\overline{G}(1, 4)) \cong \mathrm{rowspace}(G_X)$</span> and <span>$\mathrm{rowspace}(\overline{G}(2, 4)) \cong$</span>\
-<span>$\mathrm{rowspace}(G_Z)$</span> via the permutation <span>$(3 \,\, 5 \,\, 9 \,\, 15 \,\, 13 \,\, 14 \,\, 12 \,\, 7 \,\, 11 \,\, 8 \,\, 4)$</span>.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../The Vardy-Be’ery Decomposition/">« The Vardy-Be’ery Decomposition</a><a class="docs-footer-nextpage" href="../../Classical/linear_code/">Linear Codes »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 0.27.24 on <span class="colophon-date" title="Wednesday 14 February 2024 19:14">Wednesday 14 February 2024</span>. Using Julia version 1.9.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+<span>$\mathrm{rowspace}(G_Z)$</span> via the permutation <span>$(3 \,\, 5 \,\, 9 \,\, 15 \,\, 13 \,\, 14 \,\, 12 \,\, 7 \,\, 11 \,\, 8 \,\, 4)$</span>.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../The Vardy-Be’ery Decomposition/">« The Vardy-Be’ery Decomposition</a><a class="docs-footer-nextpage" href="../../Classical/linear_code/">Linear Codes »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 0.27.24 on <span class="colophon-date" title="Friday 1 March 2024 16:27">Friday 1 March 2024</span>. Using Julia version 1.9.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
diff --git a/dev/Examples/The Vardy-Be’ery Decomposition/index.html b/dev/Examples/The Vardy-Be’ery Decomposition/index.html
@@ -173,4 +173,4 @@
 julia&gt; C_P_full = augment(C_block, generator_matrix(QC));
 
 julia&gt; are_equivalent(C_P_full, C_big_P)
-true</code></pre><p>It is also possible to work these theorems backwards by choosing a desired subcode then seeing if a supercode can be built to contain it.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../../Tutorials/Weight Reduction/">« Weight Reduction</a><a class="docs-footer-nextpage" href="../Quantum Reed-Muller Codes/">Quantum Reed-Muller Codes »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 0.27.24 on <span class="colophon-date" title="Wednesday 14 February 2024 19:14">Wednesday 14 February 2024</span>. Using Julia version 1.9.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
+true</code></pre><p>It is also possible to work these theorems backwards by choosing a desired subcode then seeing if a supercode can be built to contain it.</p></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../../Tutorials/Weight Reduction/">« Weight Reduction</a><a class="docs-footer-nextpage" href="../Quantum Reed-Muller Codes/">Quantum Reed-Muller Codes »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 0.27.24 on <span class="colophon-date" title="Friday 1 March 2024 16:27">Friday 1 March 2024</span>. Using Julia version 1.9.4.</p></section><footer class="modal-card-foot"></footer></div></div></div></body></html>
diff --git a/dev/LDPC/Tanner_codes/index.html b/dev/LDPC/Tanner_codes/index.html
diff --git a/dev/LDPC/analysis/index.html b/dev/LDPC/analysis/index.html