graph edits

Author: valbert4

codes/classical/matrices/subspace/subspace.yml

@@ -7,7 +7,7 @@ code_id: subspace
 physical: matrices
 
 name: 'Subspace code'
-introduced: '\cite{arXiv:cs/0703061,arxiv:0805.3824}'
+introduced: '\cite{arXiv:cs/0703061,arxiv:0805.3824,arxiv:1103.3117}'
 
 
 description: |
@@ -32,7 +32,7 @@ notes:
 relations:
   parents:
     - code_id: matrices_into_matrices
-      detail: 'Subspace codes are represented my generator matrices of subspaces of \(\mathbb{F}_q^n\).'
+      detail: 'Subspace codes are represented by generator matrices of subspaces of \(\mathbb{F}_q^n\).'
   cousins:
     - code_id: projective
       detail: 'Subspace codes are sets of subspaces of a projective space \(PG(n-1,q)\).'

codes/classical/q-ary_digits/universally_optimal/semakov_zinoviev.yml

@@ -14,7 +14,7 @@ alternative_names:
   - 'Equidistant code with maximal distance'
 
 description: |
-  Member of the family of \( (c\frac{qt-1}{(t-1,q-1)},qt,ct\frac{q-1}{(t-1,q-1)}) \) \(q\)-ary codes, where \(c,t\geq 1\) and \((a,b)\) is the greatest common divisor of \(a\) and \(b\).
+  Member of a family of nonlinear \( (c\frac{qt-1}{(t-1,q-1)},qt,ct\frac{q-1}{(t-1,q-1)}) \) \(q\)-ary codes, where \(c,t\geq 1\) and \((a,b)\) is the greatest common divisor of \(a\) and \(b\).
   Such codes are universally optimal and are related to resolvable block designs.
 
 relations:

codes/classical/q-ary_digits/universally_optimal/semakov_zinoviev_zaitsev.yml

@@ -12,7 +12,7 @@ short_name: 'SZZ equidistant'
 introduced: '\cite{manual:{N. V. Semakov, V. A. Zinoviev, G. V. Zaitsev, “A Class of Maximum Equidistant Codes”, Probl. Peredachi Inf., 5:2 (1969), 84–87; Problems Inform. Transmission, 5:2 (1969), 65–68}}'
 
 description: |
-  Member of a family that is related to affine resolvable block designs and that is universally optimal.
+  Member of a nonlinear \(q\)-ary code family that is related to affine resolvable block designs and that is universally optimal.
 
 relations:
   parents: