/usr/share/octave/packages/communications-1.2.0/fibodeco.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 | ## Copyright (C) 2006 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} {} fibodeco (@var{code})
##
## Returns the decoded Fibonacci value from the binary vectors @var{code}.
## Universal codes like Fibonacci codes have a useful synchronization property,
## only for 255 maximum value we have designed these routines. We assume
## user has partitioned the code into several unique segments based on
## the suffix property of unique strings "11" and we just decode the
## parts. Partitioning the stream is as simple as identifying the
## "11" pairs that occur, at the terminating ends. This system implements
## the standard binary Fibonacci codes, which means that row vectors
## can only contain 0 or 1. Ref: @url{http://en.wikipedia.org/wiki/Fibonacci_coding}
##
## @example
## @group
## fibodeco (@{[0 1 0 0 1 1]@})
## @result{} 10
## fibodeco (@{[1 1], [0 1 1], [0 0 1 1], [1 0 1 1]@})
## @result{} [1, 2, 3, 4]
## @end group
## @end example
## @seealso{fiboenco}
## @end deftypefn
function num = fibodeco (code)
##
## generate fibonacci series table.
##
## f(1)=1;
## f(2)=1;
##
## while ((f(end-1)+f(end)) < 256)
## val=(f(end-1)+f(end));
## f=[f val];
## endwhile
## f=f(2:end);
##
## all numbers terminate with 1 except 0 itself.
##
##
## f= [75025 46368 28657 17711 10946 6765 4181 2584 \
## 1597 987 610 377 233 144 89 55 \
## 34 21 13 8 5 3 2 1];
##
## f= [ 233 144 89 55 34 21 13 8 5 3 2 1];
f = [1 2 3 5 8 13 21 34 55 89 144 233];
L_C = length (code);
if (nargin != 1)
print_usage ();
endif
for j = 1:L_C
word = code{j};
## discard the terminating 1.
word = word(1:end-1);
L = length (word);
num(j) = sum (word.*f(1:L));
endfor
endfunction
%!assert (fibodeco ({[1 1], [0 1 1], [0 0 1 1], [1 0 1 1]}), [1:4])
%!assert (fibodeco ({[0 1 0 0 1 1]}), 10)
%% Test input validation
%!error fibodeco ()
%!error fibodeco (1, 2)
|