As an efficient and simple variable length coding technique

Huffman codes are being widely used in text

image

video compression and so on. To reduce the requirement of the memory space

simplify encoding procedure

a layer information table(LIT) of Huffman tree is discussed to describe and reconstruct Huffman tree. An approach which adopts a special operating technique for a kind of structural array is designed to get data of LIT. A canonical Huffman tree(CAHT) is presented in this paper

and the existence

determination conditions and properties of encoding and decoding for CAHT are proved. Using LIT and encoding properties of CAHT

Huffman codes can be directly found. Comparing with traditional Huffman coding technique and other improved algorithms

the best advantage of the algorithm NHTC proposed in this paper is no need to create Huffman tree

so the operating process and coding procedure are more simplified and memory space requirement is reduced significantly.