• Citations Per Year
Learn More
The conventional Huffman table, which stores a set of code words with different lengths, is difficult to construct. An easily constructed table that includes a code-length array and an encoding mapping array can accompany an encoding procedure to replace the conventional Huffman table. The code-length array records the number of code words of the same(More)
A new method with order-N complexity is presented to construct Huffman-type minimum-redundancy codes for N distinguished symbols in the source alphabets. This method includes a contraction process as well as an expansion process. The contraction process has ( N 3) contraction stages. To reduce the data-transfer operations, ( N 5 ) vacancies are reserved(More)
  • 1