2010•Computer Knowledge and TechnologyRequires access

Improvement of Huffman Tree Algorithm

Na Xie

Abstract

At present,Huffman coding is one of an efficient coding-decoding in the communication process.But building a Huffman tree is the premise of structure Huffman coding .And the Huffman tree is also used in best decision tree.Huffman tree algorithm in practical applications is very broad.This paper investigated the Huffman tree algorithm and improved it.Therefore time complexity of the algorithm is improved.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Huffman coding, Canonical Huffman code, Computer science, Tunstall coding, Shannon–Fano coding, Algorithm, Coding (social sciences), Tree (set theory)