~

Author: valbert4

code_extra/bib_preset.yml

@@ -621,7 +621,7 @@ Semakov71:
 Sidelnikov97:
   _ready_formatted:
     flm: >-
-      V. M. Sidelnikov, “On a finite group of matrices and codes on the Euclidean sphere”, (in Russian), Problemy Peredachi Informatsii 33, 35–54 (1997); English translation in Problems of Information Transmission 33, 29–44 (1997)
+      V. M. Sidelnikov, “On a finite group of matrices and codes on the Euclidean sphere”, Problemy Peredachi Informatsii 33, 35–54 (1997); English translation in Problems of Information Transmission 33, 29–44 (1997)
 
 Sloane04:
   _ready_formatted:
@@ -661,7 +661,7 @@ Varshamov65:
 Vasilyev62:
   _ready_formatted:
     flm: >-
-      J. L. Vasilyev, “On nongroup close-packed codes”, (in Russian), Problemy Kibernetiki 8, 337-339 (1962), translated in Probleme der Kibernetik 8, 375-378 (1965)
+      J. L. Vasilyev, “On nongroup close-packed codes”, Problemy Kibernetiki 8, 337-339 (1962); translated in Probleme der Kibernetik 8, 375-378 (1965)
 
 Venkov01:
   _ready_formatted:

codes/classical/q-ary_digits/ag/evaluationAG/plane_curve.yml

@@ -17,7 +17,7 @@ protection: 'Bezout''s theorem yields parameters \([n,k,d]\), which depend on th
 
 features:
   decoders:
-    - 'Generalization of the Peterson algorithm for BCH codes \cite{doi:10.1109/18.32157,doi:10.1109/18.57204,manual:{V. Yu. Krachkovsky, (1988) “Decoding of codes on algebraic curves”, Proceedings of the IX All-Union Conference on the Theory of Coding and Information Transmission, Moscow-Odessa: USSR Academy of Sciences, 1988 Part 2, pp. 143–146 (in Russian)}}.'
+    - 'Generalization of the Peterson algorithm for BCH codes \cite{doi:10.1109/18.32157,doi:10.1109/18.57204,manual:{V. Yu. Krachkovsky, (1988) “Decoding of codes on algebraic curves”, Proceedings of the IX All-Union Conference on the Theory of Coding and Information Transmission, Moscow-Odessa: USSR Academy of Sciences, 1988 Part 2, pp. 143–146}}.'
 
 relations:
   parents: