~

codes/classical/bits/nonlinear/gray_map/duals/preparata.yml

@@ -3,7 +3,6 @@
 ##       https://github.com/errorcorrectionzoo       ##
 #######################################################
 
-# code id, physical, logical are all lower case
 code_id: preparata
 physical: bits
 logical: bits

codes/classical/matrices/regenerating/mbr.yml

@@ -15,7 +15,7 @@ description: 'Stub.'
 relations:
   parents:
     - code_id: regenerating
-      detail: 'MBR codes are extreme points in the storage-bandwidth trade-off curve and are characterised by \(\alpha = d\beta\)'
+      detail: 'MBR codes are extreme points in the storage-bandwidth trade-off curve and are characterised by \(\alpha = d\beta\).'
 
 
 # Begin Entry Meta Information

codes/classical/matrices/regenerating/msr.yml

@@ -15,7 +15,7 @@ description: 'Stub.'
 relations:
   parents:
     - code_id: regenerating
-      detail: 'MSR codes are extreme points in the storage-bandwidth trade-off curve and are characterised by \(\alpha = (d-k+1)\beta\)'
+      detail: 'MSR codes are extreme points in the storage-bandwidth trade-off curve and are characterised by \(\alpha = (d-k+1)\beta\).'
 
 
 # Begin Entry Meta Information

codes/classical/matrices/regenerating/product_matrix.yml

@@ -13,6 +13,7 @@ introduced: '\cite{doi:10.1109/TIT.2011.2159049}'
 
 description: |
     Code constructed using two explicit constructions, with each construction corresponding to one of the two extreme points of the storage-bandwidth trade-off curve \cite{doi:10.1109/TIT.2010.2054295}.
+
     For the MBR point, the parameters of the code are \([n,k, n-1 \ge d\ge k, \alpha, \beta = \frac{\alpha}{d}, M= kd-\binom{k}{2}]\).
     For the MSR point, the parameters of the code are \([n,k,d \ge 2k-2, \alpha, \beta = \frac{\alpha}{d-k+1}, M=k\alpha]\).
 

codes/classical/matrices/regenerating/regenerating.yml

@@ -27,7 +27,7 @@ protection: |
     Corrects upto \(n-k\) erasures on coordinates.
     For standard erasure codes, like Reed-Solomon, total download bandwidth for recovery of a single node is \(k\alpha\) due to the MDS property.
     For regenerating codes, it is \(d\beta\) which can be significantly less.
-    It was shown by network coding arguments that \(M \le \sum_{i=0}{k-1}\min\{\alpha,\(d-i\)\beta\}\).
+    It was shown by network coding arguments that \(M \le \sum_{i=0}{k-1}\min\{\alpha,(d-i)\beta\}\).
     Depending on the relative values of \(\alpha\) and \(\beta\), a trade-off between storage per node and download bandwidth arises.
     Two extreme points of this trade-off curve are the MBR (\(\alpha = d\beta\)) and MSR (\(\alpha = (d-k+1)\beta\)) codes.
 

codes/classical/properties/block/symmetry/cyclic/quasi_cyclic.yml

@@ -32,9 +32,6 @@ relations:
     - 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}.'
 
-# quasi_group because there can be quasi-cyclic over rings
-#quasi_twisted
-
 
 # Begin Entry Meta Information
 _meta:

codes/classical/q-ary_digits/distributed_storage/lrc/locally_recoverable.yml

@@ -16,7 +16,8 @@ alternative_names:
   - 'Locally correctable code (LCC)'
 
 description: |
-  Any code for which, given a codeword \(x\) and coordinate \(i\), \(x_i\) can be recovered from (at most \(r\)) other coordinates of \(x\). An \(r\)-locally recoverable code of length \(n\) and dimension \(k\) is denoted as an \((n,k,r)\) LRC code.
+  Any code for which, given a codeword \(x\) and coordinate \(i\), \(x_i\) can be recovered from (at most \(r\)) other coordinates of \(x\).
+  An \(r\)-locally recoverable code of length \(n\) and dimension \(k\) is denoted as an \((n,k,r)\) LRC code.
 
   More technically, a \(q\)-ary code \(C\) with length \(n\) is \(r\)-locally recoverable, or \textit{has locality} \(r\), if \(\forall i \in [n]\), there exists \(I_i \subset [n]\setminus i\) such that \(|I_i|\leq r\), and the projection of the set \(\mathcal{C}(i,a)=\{x\in C : x_i=a\}\) on to the coordinates in \(I_i\), i.e., \(\mathcal{C}_{I_i}(i,a)\) is disjoint from \(\mathcal{C}_{I_i}(i,a^\prime)\) where \(a\neq a^\prime\).
 
@@ -37,10 +38,6 @@ relations:
     - code_id: q-ary_digits_into_q-ary_digits
       detail: 'Locally recoverable codes protect against coordinate erasure.'
     - code_id: distributed_storage
-#    - code_id: codes_with_availability
-#      detail: ''
-#     - code_id: regenerating_code
-#       detail: ''
 
 
 # Begin Entry Meta Information

codes/quantum/qubits/stabilizer/topological/surface/two_dim/two_dimensional_hyperbolic_surface.yml

@@ -7,7 +7,7 @@ code_id: two_dimensional_hyperbolic_surface
 physical: qubits
 logical: qubits
 
-name: 'Two-dimensional hyperbolic surface code'
+name: '2D hyperbolic surface code'
 introduced: '\cite{arXiv:1506.04029}'
 
 description: |
@@ -26,7 +26,7 @@ protection: 'Protects against Pauli errors with distance \( d \propto \log(n) \)
 
 features:
 
-  rate: 'Two-dimensional hyperbolic surface codes have an asymptotically constant encoding rate \( k/n \) with a distance scaling logarithmically with \( n\) when the surface is closed. The encoding rate depends on the tiling \( {r,s} \) and is given by \( k/n = (1-2/r - 2/s) + 2/n \), which approaches a constant value as the number of physical qubits grows. The weight of the stabilizers is \( r \) for \( Z \)-checks and \( s \) for \( X \)-checks. For open boundary conditions, the code reduces to constant distnace.'
+  rate: '2D hyperbolic surface codes have an asymptotically constant encoding rate \( k/n \) with a distance scaling logarithmically with \( n\) when the surface is closed. The encoding rate depends on the tiling \( {r,s} \) and is given by \( k/n = (1-2/r - 2/s) + 2/n \), which approaches a constant value as the number of physical qubits grows. The weight of the stabilizers is \( r \) for \( Z \)-checks and \( s \) for \( X \)-checks. For open boundary conditions, the code reduces to constant distnace.'
 
 #   encoders: