~

Author: valbert4

CONTRIBUTING.md

@@ -6,7 +6,7 @@ welcome.
 
 ## How to contribute content
 
-You can contribute by opening sending us an [email][eczooemail], opening an
+You can contribute by sending us an [email][eczooemail], opening an
 issue, or sending us a pull request.
 
 The content of the Zoo is entered in structured form in YAML files.  Each

README.md

@@ -147,7 +147,7 @@ repository](https://github.com/errorcorrectionzoo/eczoo_sitegen).
 ## I want to create the <Your Favorite Topic> Zoo. How did you build the EC Zoo and can I reuse your code?
 
 The error correction zoo is based on [ZooDb JS library framework](https://github.com/phfaist/zoodb).  You
-are welcome to use develop your own Zoo based on this library.  Consider starting with [this simple toy
+are welcome to develop your own Zoo based on this library.  Consider starting with [this simple toy
 example of a zoo built with ZooDb](https://github.com/phfaist/zoodb-example).
 
 Get in touch with me! I'll be happy to point to the basic tools we used and how they

codes/classical/bits/nonlinear/levenshtein.yml

@@ -17,7 +17,8 @@ description: |
 
   Next, apply the following way of combining codes. Suppose we have an \((n_1,M_1,d_1)\) code \(C_1\) and an \((n_2,M_2,d_2)\) code \(C_2\). The combined \((an_1+bn_2,\min(M_1,M_2),ad_1+bd_2)\) code \(a C_1\oplus b C_2\) may be constructed by pasting \(a\) copies of \(C_1\) and \(b\) copies of \(C_2\) together and omitting the last \(|M_1-M_2|\) rows. Applying this to construct a Levenshtein code with length \(n\) and distance \(d\), define \(k=\lfloor d/(2d-n)\rfloor\), \(a=d(2k+1)-n(k+1)\), and \(b=kn-d(2k-1)\). If \(n\) is even, construct \(\frac{a}{2}A_{4k}'\oplus\frac{b}{2}A_{4k+4}'\). If \(n\) is odd and \(k\) is even, construct \(aA_{2k}\oplus\frac{b}{2}A_{4k+4}'\). If \(n\) is odd and \(k\) is odd, construct \(\frac{a}{2}A_{4k}'\oplus b A_{2k+2}\).
 
-protection: Levenshtein codes meet the Plotkin bound \(K\leq 2\left\lfloor\frac{d}{2d-n}\right\rfloor\), where \(K\) is the number of codewords, \(d\) is the distance, and \(n\) is the length, and with the assumption that the Hadamard matrices for such parameters exist. The general proof depends on the correctness of Hadamard's conjecture \cite{preset:MacSlo}.
+protection: |
+  Levenshtein codes meet the Plotkin bound \(K\leq 2\left\lfloor\frac{d}{2d-n}\right\rfloor\), where \(K\) is the number of codewords, \(d\) is the distance, and \(n\) is the length, and with the assumption that the Hadamard matrices for such parameters exist. The general proof depends on the correctness of Hadamard's conjecture \cite{preset:MacSlo}.
 
 relations:
   parents:

codes/classical/properties/block/distributed_storage/ldc.yml

@@ -36,8 +36,6 @@ relations:
     - code_id: block
     - code_id: ecc_finite
   cousins:
-    - code_id: lcc
-      detail: 'LDCs and LCCs are closely related and often studied together; any family of LCCs can be converted to a family of LDCs whose rate differs by a constant \cite{arxiv:1611.06980}.'
     - code_id: ltc
       detail: 'There are relations between LDCs and LTCs \cite{doi:10.1007/978-3-642-15369-3_50}.'
     - code_id: quantum_locally_recoverable

codes/classical/spherical/polytope/infinite/simplex_spherical/simplex_spherical.yml

@@ -12,7 +12,7 @@ name: 'Simplex spherical code'
 description: |
   Spherical \((n,n+1,2+2/n)\) code whose codewords are all permutations of the \(n+1\)-dimensional vector \((1,1,\cdots,1,-n)\), up to normalization, forming an \(n\)-simplex.
   Codewords are all equidistant and their components add up to zero.
-  Simplex spherical codewords in 2 (3, 4) dimensions form the vertices of a triangle (tetrahedron, 5-cell)
+  Simplex spherical codewords in 2 (3, 4) dimensions form the vertices of a triangle (tetrahedron, 5-cell).
   In general, the code makes up the vertices of an \(n\)-simplex.
   The union of a simplex and its antipodal simplex forms the vertices of a bi-simplex, which has \(2(n+1)\) vertices.
 

template.yml

@@ -65,7 +65,7 @@ features:
 
   rate: 'k/n, usually listed for a family of codes, but can be notable for a single one. Discussed alongside other parameters such as check operator weight, distance, etc.'
 
-  # This key that starts a list of strings, indexed by a dash and a space; do not leave it
+  # This key starts a list of strings, indexed by a dash and a space; do not leave it
   # empty. If empty, comment out.
   encoders:
     - 'Specific description of a process that makes the states, usually for quantum codes.'
@@ -95,7 +95,7 @@ features:
     - 'Pieceable fault tolerance.'
 
   code_capacity_threshold:
-    - '\(1.5%\) error-correction threshold against some noise with *noiseless* decoder of some complexity \cite{arxiv:paper}.'
+    - '\(1.5\%\) error-correction threshold against some noise with *noiseless* decoder of some complexity \cite{arxiv:paper}.'
     - '\(5.2\%\) asymptotic upper bound from some estimation algorithm (Monte Carlo, e.g.) that may or may not have a feasible decoder.'
 
   threshold: