Results 1 
3 of
3
Code and parse trees for lossless source encoding
 Communications in Information and Systems
, 2001
"... This paper surveys the theoretical literature on fixedtovariablelength lossless source code trees, called code trees, and on variablelengthtofixed lossless sounce code trees, called parse trees. Huffman coding [ l] is the most well known code tree problem, but there are a number of interestin ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
(Show Context)
This paper surveys the theoretical literature on fixedtovariablelength lossless source code trees, called code trees, and on variablelengthtofixed lossless sounce code trees, called parse trees. Huffman coding [ l] is the most well known code tree problem, but there are a number of interesting variants of the problem formulation which lead to other combinatorial optimization problems. Huffman coding as an
An Efficient Decoding Technique for Huffman Codes
, 2002
"... We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of s ..."
Abstract
 Add to MetaCart
(Show Context)
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [Inform. Process. Lett. 69 (1999) 119122]. 2002 Elsevier Science B.V. All rights reserved.
An efficient decoding technique for Huffman codes
, 2001
"... We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of s ..."
Abstract
 Add to MetaCart
(Show Context)
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure