動態逼近加權壓縮法：實作與分析

Abstract

我們實作並分析了加權二元頻道上的動態壓縮演算法，實驗顯示在一般情況下我們的演算法確實能夠達到接近於理想值的壓縮比。

Abstract In this paper we consider the adaptive case of pre‾x-free coding with unequal letter costs. That is, given an alphabet with size n, and a binary channel with unequal cost digits, we try to construct a pre‾x-free code W adaptively. Our goal is to achieve or approximate minimum-redundancy a tree-based method can generate. Our experimental results show that generally our adaptive algorithms can construct codes with low redundancy. . Key Words: information theory, source coding, unequal cost, adaptive algo- rithm, binary channel.