Fast and efficient variable-to-fixed length coding algorithm
作者： T. Algra
DOI: 10.1049/EL:19920890
关键词: Mathematics 、 Variable-length code 、 Algorithm 、 Tunstall coding 、 Huffman coding 、 Arithmetic 、 Coding tree unit 、 Context-adaptive variable-length coding 、 Context-adaptive binary arithmetic coding 、 Modified Huffman coding 、 Shannon–Fano coding
摘要: Variable-to-fixed-length coding implementations, according to the Tunstall algorithm, are shown be significantly less complex than fixed-to-variable-length schemes such as Huffman scheme. A modified version of is presented, with improved compression ratio.
harvard.edu
sci-hub.se 参考文章(6)
Brian Parker Tunstall, Synthesis of noiseless compression codes Georgia Institute of Technology. ,(1967)
Majid Rabbani, Paul W. Jones, Digital Image Compression Techniques ,(1991)
K. Liu, On Chain Coding of Line Drawings Delft University Press. ,(1992)
H. Tanaka, Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.) IEEE Transactions on Information Theory. ,vol. 33, pp. 154- 156 ,(1987) , 10.1109/TIT.1987.1057265
Andrzej Siemiński, Fast decoding of the Huffman codes Information Processing Letters. ,vol. 26, pp. 237- 241 ,(1988) , 10.1016/0020-0190(88)90146-9
Majid Rabbani, Paul W. Jones, Digital Image Compression Techniques SPIE. ,(1991) , 10.1117/3.34917