## [f62e8c]: inst / gen2par.m  Maximize  Restore  History

### 56 lines (47 with data), 1.8 kB

 ``` 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``` ```## Copyright (C) 2003 David Bateman ## ## 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 . ## -*- texinfo -*- ## @deftypefn {Function File} {@var{par} =} gen2par (@var{gen}) ## @deftypefnx {Function File} {@var{gen} =} gen2par (@var{par}) ## ## Converts binary generator matrix @var{gen} to the parity check matrix ## @var{par} and visa-versa. The input matrix must be in standard form. ## That is a generator matrix must be k-by-n and in the form [eye(k) P] ## or [P eye(k)], and the parity matrix must be (n-k)-by-n and of the ## form [eye(n-k) P'] or [P' eye(n-k)]. ## ## @seealso{cyclgen, hammgen} ## @end deftypefn function par = gen2par (gen) if (nargin != 1) print_usage (); endif [gr, gc] = size (gen); if (gr > gc) error ("gen2par: GEN must be a generator matrix in standard form"); endif ## Identify where is the identity matrix if (isequal (gen(:,1:gr), eye (gr))) par = [gen(:,gr+1:gc)', eye(gc-gr)]; elseif (isequal (gen(:,gc-gr+1:gc), eye (gr))) par = [eye(gc-gr), gen(:,1:gc-gr)']; else error ("gen2par: GEN must be a generator matrix in standard form"); endif endfunction %% Test input validation %!error gen2par () %!error gen2par (1, 2) %!error gen2par ([1; 2]) ```

No, thanks