From 30af1814f3e31b348776a4e4714a5b694a7bc45f Mon Sep 17 00:00:00 2001
From: VVA2024 <valbert4@gmail.com>
Date: Tue, 7 Jan 2025 18:57:21 -0500
Subject: [PATCH] ~

---
 .../classical/properties/block/symmetry/cyclic/quasi_cyclic.yml | 2 ++
 codes/quantum/qubits/small_distance/small/8/qubit_8_1_3.yml     | 2 +-
 codes/quantum/qudits/stabilizer/single_qudit/qudit_sign.yml     | 1 -
 3 files changed, 3 insertions(+), 2 deletions(-)

diff --git a/codes/classical/properties/block/symmetry/cyclic/quasi_cyclic.yml b/codes/classical/properties/block/symmetry/cyclic/quasi_cyclic.yml
index 8f62792b2..451e90c64 100644
--- a/codes/classical/properties/block/symmetry/cyclic/quasi_cyclic.yml
+++ b/codes/classical/properties/block/symmetry/cyclic/quasi_cyclic.yml
@@ -32,6 +32,8 @@ relations:
       detail: 'Quasi-cyclic codes can be \textit{unwrapped} to obtain convolutional codes \cite{manual:{G. D. Forney, Jr., “Why quasi cyclic codes are interesting,” unpublished note, 1970.},doi:10.1137/0137027,manual:{R. Michael Tanner, “Error-correcting coding system,” U.S. Patent 4295218, 1981.},manual:{R. Michael Tanner. Convolutional codes from quasi-cyclic codes: A link between the theories of block and convolutional codes. University of California, Santa Cruz, Computer Research Laboratory, 1987.},manual:{“Generalized tail-biting convolutional codes,” Ph.D. dissertation, Univ. of Massachusetts, Amherst, 1985.},manual:{Y. Levy and J. Costello, Jr., “An algebraic approach to constructing convolutional codes from quasi-cyclic codes,” DIMACS Ser. Discr. Math. and Theor. Comp. Sci., vol. 14, pp. 189–198, 1993.},doi:10.1109/18.651076}.'
     - code_id: sc_qldpc
       detail: 'Quasi-cyclic binary code parity-check matrices can be used as sub-matrices to define a 1D SC-QLDPC code \cite{arxiv:1102.3181}.'
+    - code_id: quantum_divisible
+      detail: 'Certain double circulant codes can be used to construct doubly even \([[55,1,11]]\) and \([[87,1,15]]\) codes \cite{arxiv:quant-ph/9708021}.'
 
 
 # Begin Entry Meta Information
diff --git a/codes/quantum/qubits/small_distance/small/8/qubit_8_1_3.yml b/codes/quantum/qubits/small_distance/small/8/qubit_8_1_3.yml
index 62e4e5af6..03d05939c 100644
--- a/codes/quantum/qubits/small_distance/small/8/qubit_8_1_3.yml
+++ b/codes/quantum/qubits/small_distance/small/8/qubit_8_1_3.yml
@@ -11,7 +11,7 @@ name: '\(((8,1,3))\) Plenio-Vedral-Knight CE code'
 introduced: '\cite{arxiv:quant-ph/9603022}'
 
 description: |
-  An eight-qubit qubit code that is the first CE code. 
+  An eight-qubit single error-correcting code that is the first CE code. 
   Each logical state is a superposition of computational basis states with four excitations.
 
   Admits codewords of the form
diff --git a/codes/quantum/qudits/stabilizer/single_qudit/qudit_sign.yml b/codes/quantum/qudits/stabilizer/single_qudit/qudit_sign.yml
index 2abbf7d60..486f902eb 100644
--- a/codes/quantum/qudits/stabilizer/single_qudit/qudit_sign.yml
+++ b/codes/quantum/qudits/stabilizer/single_qudit/qudit_sign.yml
@@ -13,7 +13,6 @@ introduced: '\cite{arxiv:0705.1099}'
 
 description: |
   Monolithic code encoding a qubit into a single modular qudit and protecting against either \(Z\)-type or \(X\)-type modular-qudit Pauli shifts.
-  The modular-qudit shift-resistant code is not a block code, but it is perfect in the sense that each correctable error maps the logical space into a distinct error space.
 
   The simplest example requires a 6-dimensional qudit.
   The bit-flip version admits codewords \(|0\rangle\) and \(|3\rangle\) and corrects a single \(X\)-type shift.