ScholarLens Back to search
2010•Computer EraRequires access

High Efficiency Algorithm of Constructing Huffman Tree

Yuanyuan Chen

Open publisher page 0 citations

Abstract

Coding and decoding depend on a particular Huffman tree,so a new algorithm of constructing Huffman tree is put forward for improving efficiency.

About this research paper

What this paper is about

Coding and decoding depend on a particular Huffman tree,so a new algorithm of constructing Huffman tree is put forward for improving efficiency.

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

Coding and decoding depend on a particular Huffman tree,so a new algorithm of constructing Huffman tree is put forward for improving efficiency.

Key concepts: Computer science, Huffman coding, Algorithm, Tree (set theory), Mathematics, Data compression, Combinatorics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
High Efficiency Algorithm of Constructing Huffman Tree — Research Paper | ScholarLens