## Diff of /inst/reedmullerdec.m[786917] .. [d6dad2]  Maximize  Restore

### Switch to side-by-side view

```--- a/inst/reedmullerdec.m
+++ b/inst/reedmullerdec.m
@@ -60,7 +60,7 @@
## at each order of polynomial modifying the code-word.
U = 0:M-1; # allowed basis vectors in V2^M.
C = -1 * ones (size (VV)); # preset the output word.
-  [Rows, Cols] = size (G);   # rows shadows 'rows()'
+  [Rows, Cols] = size (G);   # rows shadows rows()

## first get the row index of G & its corresponding permutation
## elements.
@@ -107,13 +107,13 @@
prev_len = length (P{Rows});
for idx = Rows:-1:1
-      ## adjust the 'V' received vector, at change of each order.
+      ## adjust the V received vector, at change of each order.
if (prev_len ~= length (P{idx})  || idx == 1) # force for_ idx=1
V = mod (V+ v_adjust, 2); # + = - in GF(2).
order = order - 1;
-        if (order == 0) # special handling of the all-1's basis vector.
+        if (order == 0) # special handling of the all-1s basis vector.
CM(idx) = __majority_logic_vote (V);
break
endif
@@ -121,7 +121,7 @@

prev_len = length (P{idx});
Si = P{idx}; # index identifier
-      Si = sort (Si, 'descend');
+      Si = sort (Si, "descend");

## generate index elements
B = __binvec (0:(2.^length (Si) - 1));
@@ -139,7 +139,7 @@
endif
endfor
SCi(rmidx) = [];
-      SCi = sort (SCi, 'descend');
+      SCi = sort (SCi, "descend");

## corner case RM(r=m,m) case
if (length (SCi) > 0)
@@ -194,7 +194,7 @@

function wt = __majority_logic_vote (wts)

-  wt = sum (wts) - sum (1 - wts); # count no of 1's - no of 0's.
+  wt = sum (wts) - sum (1 - wts); # count no of 1s - no of 0s.
if (wt ~= 0)
wt = (wt > 0);
#else
```