graph edits - rm

Author: valbert4

…ical/bits/reed_muller/cordaro_wagner.yml …s/classical/bits/easy/cordaro_wagner.ymlcodes/classical/bits/reed_muller/cordaro_wagner.yml renamed to codes/classical/bits/easy/cordaro_wagner.yml codes/classical/bits/reed_muller/cordaro_wagner.yml renamed to codes/classical/bits/easy/cordaro_wagner.yml

@@ -58,6 +58,8 @@ relations:
     - code_id: constant_weight
       detail: 'Linear binary codes cannot be constant weight, but can have nonzero codewords with constant weight. All such codes are equidistant, and Bonisoli''s theorem states that any equidistant linear binary code is a direct sum of simplex codes \cite{manual:{Bonisoli, Arrigo. "Every equidistant linear code is a sequence of dual Hamming codes." Ars Combinatoria 18 (1984): 181-186.}} (see also Refs. \cite{doi:10.1016/S0019-9958(63)80010-8,doi:10.1137/0114009}).'
     # Also in constant_weight
+    - code_id: reed_muller
+      detail: 'Simplex are equivalent to RM\(^*(1,m)\).'
 
 
 # Begin Entry Meta Information

…ical/bits/easy/dual_hamming/hadamard.yml …ts/reed_muller/dual_hamming/hadamard.ymlcodes/classical/bits/easy/dual_hamming/hadamard.yml renamed to codes/classical/bits/reed_muller/dual_hamming/hadamard.yml codes/classical/bits/easy/dual_hamming/hadamard.yml renamed to codes/classical/bits/reed_muller/dual_hamming/hadamard.yml

@@ -7,18 +7,22 @@ code_id: extended_hamming
 physical: bits
 logical: bits
 
-name: '\([2^r,2^r-r-1,4]\) Extended Hamming code'
+name: '\([2^m,2^m-m-1,4]\) Extended Hamming code'
 introduced: '\cite{doi:10.1002/j.1538-7305.1948.tb01338.x,doi:10.1002/j.1538-7305.1950.tb00463.x,manual:{M. J. E. Golay, \emph{Notes on digital coding}, Proc. IEEE, 37 (1949) 657.}}'
 
+alternative_names:
+  - 'RM\((m-2,m)\) code'
+
 description: |
-  Member of an infinite family of binary linear codes with parameters \([2^r,2^r-r-1, 4]\) for \(r \geq 2\) that are extensions of the Hamming codes by a parity-check bit.
+  Member of an infinite family of RM\((m-2,m)\) codes with parameters \([2^m,2^m-m-1, 4]\) for \(m \geq 2\) that are extensions of the Hamming codes by a parity-check bit.
 
 relations:
   parents:
-    - code_id: karlin
-      detail: 'The extended Hamming code is equivalent to the Karlin double circulant code for \(m=3\) \cite[Ch. 16]{preset:MacSlo}.'
+    - code_id: reed_muller
     - code_id: binary_quad_residue
       detail: 'The extended Hamming code is an extended binary quadratic-residue code \cite[Ch. 16]{preset:MacSlo}.'
+    - code_id: karlin
+      detail: 'The extended Hamming code is equivalent to the Karlin double circulant code for \(m=3\) \cite[Ch. 16]{preset:MacSlo}.'
     - code_id: small_distance
   cousins:
     - code_id: univ_opt_q-ary

…al/bits/easy/dual_hamming/repetition.yml …/reed_muller/dual_hamming/repetition.ymlcodes/classical/bits/easy/dual_hamming/repetition.yml renamed to codes/classical/bits/reed_muller/dual_hamming/repetition.yml codes/classical/bits/easy/dual_hamming/repetition.yml renamed to codes/classical/bits/reed_muller/dual_hamming/repetition.yml

@@ -44,10 +44,11 @@ realizations:
 notes:
   - 'See \cite[Chs. 13-15]{preset:MacSlo}\cite{doi:10.1017/CBO9781316529836} for details of RM codes and their variants.'
 
+
 # If mobing to evaluation, then remove "nontrivial" in that entry
 relations:
   parents:
-    - code_id: binary_linear
+    - code_id: coxeter
     - code_id: uplusv
       detail: 'All RM codes can be constructed via the \((u|u+v)\) construction \cite[Ch. 13]{preset:MacSlo}.'
     - code_id: generalized_reed_muller