/usr/share/octave/packages/communications-1.2.0/reedmullergen.m is in octave-communications-common 1.2.0-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | ## Copyright (C) 2007 Muthiah Annamalai <muthiah.annamalai@uta.edu>
##
## This program is free software; you can redistribute it and/or modify it under
## the terms of the GNU General Public License as published by the Free Software
## Foundation; either version 3 of the License, or (at your option) any later
## version.
##
## This program is distributed in the hope that it will be useful, but WITHOUT
## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
## FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
## details.
##
## You should have received a copy of the GNU General Public License along with
## this program; if not, see <http://www.gnu.org/licenses/>.
## -*- texinfo -*-
## @deftypefn {Function File} {} reedmullergen (@var{R}, @var{M})
##
## Definition type construction of Reed-Muller code,
## of order @var{R}, length @math{2^M}. This function
## returns the generator matrix for the said order RM code.
##
## RM(r,m) codes are characterized by codewords,
## @code{sum ( (m,0) + (m,1) + @dots{} + (m,r)}.
## Each of the codeword is got through spanning the
## space, using the finite set of m-basis codewords.
## Each codeword is @math{2^M} elements long.
## see: Lin & Costello, "Error Control Coding", 2nd Ed.
##
## Faster code constructions (also easier) exist, but since
## finding permutation order of the basis vectors, is important, we
## stick with the standard definitions. To use decoder
## function reedmullerdec, you need to use this specific
## generator function.
##
## @example
## @group
## g = reedmullergen (2, 4);
## @end group
## @end example
## @seealso{reedmullerdec, reedmullerenc}
## @end deftypefn
function G = reedmullergen (R, M)
if (nargin != 2)
print_usage ();
endif
G = ones (1, 2^M);
if (R == 0)
return;
endif
a = [0];
b = [1];
V = [];
for idx = 1:M;
row = repmat ([a, b], [1, 2^(M-idx)]);
V(idx,:) = row;
a = [a, a];
b = [b, b];
endfor
G = [G; V];
if (R == 1)
return
else
r = 2;
while (r <= R)
p = nchoosek (1:M, r);
prod = V(p(:,1),:) .* V(p(:,2),:);
for idx = 3:r
prod = prod .* V(p(:,idx),:);
endfor
G = [G; prod];
r = r + 1;
endwhile
endif
endfunction
%% Test input validation
%!error reedmullergen ()
%!error reedmullergen (1)
%!error reedmullergen (1, 2, 3)
|