huffman.m

来自「霍夫曼编码」· M 代码 · 共 32 行

function[h,l]=huffman(p);
% if length(find(p<0))~=0
%     error('Input is not a prob.vector,there is negative component')
% end
% if abs(sum(p)-1)>10e-10
%     error('Input is not a prob.vector,the sum of the components is not equal to 1.')
% end
n=length(p);
q=p;
for i=1:n-1
    [q,l]=sort(q);
    m(i,:)=[l(1:n-i+1),zeros(1,i-1)];
end
for i=1:n-1
    c(i,:)=blanks(n*n);
end
c(n-1,n)='0';
c(n-1,2*n)='1';
for i=2:n-1
    c(n-i,1:n-1)=c(n-i+1,n*(find(m(n-i+1,:)==1))-(n-2):n*(find(m(n-i+1,:)==1)));
    c(n-i,n)='0';
    c(n-i,n+1:2*n-1)=c(n-i,1:n-1);
    c(n-i,2*n)='1';
    for j=1:i-1
        c(n-i,(j+1)*n+1:(j+2)*n)=c(n-i+1,n*(find(m(n-i+1,:)==j+1)-1)+1:n*find(m(n-i+1,:)==j+1));
    end
end
for i=1:n
    h(i,1:n)=c(1,n*(find(m(1,:)==i)-1)+1:find(m(1,:)==i)*n);
    ll(i)=length(find(abs(h(i,:))~=32));
end
l=sum(p.*ll);