Analysis of lossless compression for a large class of sources of information

V Munteanu, D Tarniceriu… - … Symposium on Signals …, 2009 - ieeexplore.ieee.org
We analyze the lossless compression for a large class of discrete complete and memoryless
sources performed by a generalized Huffman with an alphabet consisting of M letters. Given …

Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes-Part 1

G Zaharia, V Munteanu… - … Symposium on Signals …, 2009 - ieeexplore.ieee.org
This paper presents new results of the D-ary Huffman tree. These results are used to prove
that the maximum value of the average codeword length is obtained for the uniform …

Information quantities attached to M-ary antiuniform Huffman codes

V Munteanu, D Tarniceriu… - … Symposium on Signals …, 2009 - ieeexplore.ieee.org
In this paper M-ary antiuniform Huffman codes are considered. In this case the source
probability distribution assures the minimum average codeword length, by diversifying only …

[PDF][PDF] Analysis of Lossless Compression for a Large Class of Sources of Information-Part I

V Munteanu, D Tarniceriu, G Zaharia - academia.edu
We analyze the lossless compression for a large class of discrete complete and memoryless
sources performed by a generalized Huffman with an alphabet consisting of M letters. Given …

M-ary anti-uniform Huffman codes for infinite sources with geometric distribution

D Tarniceriu, V Munteanu… - … Symposium on Signals …, 2013 - ieeexplore.ieee.org
In this paper we consider the class of generalized anti-uniform Huffman (AUH) codes for
sources with infinite alphabet and geometric distribution. This distribution leads to infinite …