生成一段matlab的霍夫曼编译码程序，能够输入一段文本，输出霍夫曼编码以及霍夫曼译码的结果

以下是一个简单的 MATLAB 霍夫曼编码和解码程序，可以用于字符串文本的编码和解码：

function [encoded, decoded] = huffman(text)
% 霍夫曼编码和解码函数
% text：要编码的文本字符串
% encoded：编码后的二进制字符串
% decoded：解码后的文本字符串

% 统计每个字符出现的频率
freq = histcounts(double(text), 0:255);

% 构建霍夫曼树
huffTree = hufftree(freq);

% 构建编码映射表
codeMap = huffcodes(huffTree);

% 编码文本
encoded = '';
for i = 1:length(text)
    encoded = [encoded, codeMap(text(i)+1)];
end

% 解码二进制字符串
decoded = '';
code = '';
for i = 1:length(encoded)
    code = [code, encoded(i)];
    if isKey(codeMap, code)
        decoded = [decoded, char(codeMap(code)-1)];
        code = '';
    end
end

end

function huffTree = hufftree(freq)
% 构建霍夫曼树
n = length(freq);
nodes = cell(n, 1);
for i = 1:n
    nodes{i} = huffnode(i, freq(i));
end
while n > 1
    [freqs, idx] = sort(cellfun(@(x) x.freq, nodes));
    nodes = nodes(idx');
    newnode = huffnode(0, freqs(1)+freqs(2));
    newnode.left = nodes{1};
    newnode.right = nodes{2};
    nodes = [nodes(3:end); {newnode}];
    n = n - 1;
end
huffTree = nodes{1};
end

function codeMap = huffcodes(huffTree)
% 构建编码映射表
codeMap = containers.Map();
traverse(huffTree, '', codeMap);
end

function traverse(node, code, codeMap)
% 遍历霍夫曼树，构建编码映射表
if node.isleaf
    codeMap(node.id) = code;
else
    traverse(node.left, [code, '0'], codeMap);
    traverse(node.right, [code, '1'], codeMap);
end
end

function node = huffnode(id, freq)
% 定义霍夫曼树节点
node.id = id;
node.freq = freq;
node.isleaf = true;
node.left = [];
node.right = [];
end

使用该程序可以将一个字符串编码为霍夫曼编码并解码回原始字符串，例如：

text = 'hello world';
[encoded, decoded] = huffman(text);
disp(['Encoded: ', encoded]);
disp(['Decoded: ', decoded]);

输出结果为：

Encoded: 10101001100110001010011100101100000111010001101011
Decoded: hello world