% -*- texinfo -*-
% @deftypefn {Function File} {} reedmullerdec (@var{VV},@var{G},@var{R},@var{M})
%
% Decode the received code word @var{VV} using the RM-generator matrix @var{G},
% of order @var{R}, @var{M}, returning the code-word C. We use the standard
% majority logic vote method due to Irving S. Reed. The received word has to be
% a matrix of column size equal to to code-word size (i.e @math{2^m}). Each row
% is treated as a separate received word.
%
% The second return value is the message @var{M} got from @var{C}.
%
% G is obtained from definition type construction of Reed Muller code,
% of order @var{R}, length @math{2^M}. Use the function reedmullergen,
% for the generator matrix for the (@var{R},@var{M}) order RM code.
%
% 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.
%
% see: Lin & Costello, Ch.4, 'Error Control Coding', 2nd Ed, Pearson.
%
% @example
% @group
% G=reedmullergen(2,4);
% M=[rand(1,11)>0.5];
% C=mod(M*G,2);
% [dec_C,dec_M]=reedmullerdec(C,G,2,4)
%
% @end group
% @end example
%
% @end deftypefn
% @seealso{reedmullergen,reedmullerenc}