Reza Hashemian, Mohammad Ahmadi
Abstract
A Huffman (1952) code reconstruction technique is presented. It is shown that, based on some unique properties of a particular Huffman coding scheme, called single-side grown Huffman table, only certain codes need to be transmitted to the decoder to reconstruct the entire Huffman table.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A Huffman (1952) code reconstruction technique is presented. It is shown that, based on some unique properties of a particular Huffman coding scheme, called single-side grown Huffman table, only certain codes need to be transmitted to the decoder to reconstruct the entire Huffman table.
Key concepts: Huffman coding, Canonical Huffman code, Prefix code, Computer science, Tunstall coding, Shannon–Fano coding, Table (database), Code (set theory)