diff --git a/codes/classical/bits/quantum_inspired/fibonacci_model.yml b/codes/classical/bits/quantum_inspired/fibonacci_model.yml
index efc8eb862..3964707f6 100644
--- a/codes/classical/bits/quantum_inspired/fibonacci_model.yml
+++ b/codes/classical/bits/quantum_inspired/fibonacci_model.yml
@@ -19,7 +19,7 @@ protection: |
 
 features:
   decoders:
-    - 'An efficient algorithm base on minimum-weight perfect matching \cite{arXiv:2002.11738}, which can correct high-weight errors that span the lattice, with failure rate decaying super-exponentially with \(L\).'
+    - 'An efficient algorithm base on minimum-weight perfect matching \cite{arXiv:2002.11738}, which can correct high-weight errors that span rows and columns of the 2D lattice, with failure rate decaying super-exponentially with \(L\).'
 
 relations:
   parents:
diff --git a/codes/quantum/oscillators/fock_state/numopt.yml b/codes/quantum/oscillators/fock_state/numopt.yml
index 5b4a20347..9daefb3b9 100644
--- a/codes/quantum/oscillators/fock_state/numopt.yml
+++ b/codes/quantum/oscillators/fock_state/numopt.yml
@@ -29,7 +29,7 @@ relations:
     - code_id: oscillators
   cousins:
     - code_id: multimodegkp
-      detail: 'Numerically optimizing GKP code lattices yields codes for three and nine modes with larger distances and fidelities than known GKP codes \cite{arxiv:2303.04702}.'
+      detail: 'Numerically optimizing GKP code lattices yields codes for three, seven, and nine modes with larger distances and fidelities than known GKP codes \cite{arxiv:2303.04702}.'
 
 # Begin Entry Meta Information
 _meta:
diff --git a/codes/quantum/oscillators/stabilizer/lattice/multimodegkp.yml b/codes/quantum/oscillators/stabilizer/lattice/multimodegkp.yml
index 5b99a66ce..025f0c960 100644
--- a/codes/quantum/oscillators/stabilizer/lattice/multimodegkp.yml
+++ b/codes/quantum/oscillators/stabilizer/lattice/multimodegkp.yml
@@ -33,8 +33,7 @@ features:
     - 'Logical Clifford operations are given by Gaussian unitaries, which map bounded-size errors to bounded-size errors \cite{arXiv:quant-ph/0008040}.'
 
   decoders:
-    - 'The MLD decoder for Gaussian displacement errors is realized by evaluating a lattice theta function, and in general the decision can be approximated by either solving (approximating) the closest vector problem (CVP) or by using other effective iterative schemes when e.g. the lattice represents a concatenated GKP code \cite{arXiv:1810.00047,arXiv:1908.03579,arXiv:2109.14645,arxiv:2111.07029}.'
-    - 'Closest lattice point decoding \cite{arxiv:2303.04702}.'
+    - 'The MLD decoder for Gaussian displacement errors is realized by evaluating a lattice theta function, and in general the decision can be approximated by either solving (approximating) the closest vector problem (CVP) \cite{doi:10.1109/TIT.2002.800499} (a.k.a. closest lattice point problem) or by using other effective iterative schemes when e.g. the lattice represents a concatenated GKP code \cite{arXiv:1810.00047,arXiv:1908.03579,arXiv:2109.14645,arxiv:2111.07029}. While the decoder time scales exponentially with number of modes \(n\) generically, the time can be polynomial in \(n\) for certain codes \cite{arxiv:2303.04702}.'
 
 relations:
   parents: