International audienceIn this paper we address the class of anti-uniform Huffman (AUH) codes, also named unary codes, for sources with finite and infinite alphabet, respectively. Geometric, quasi-geometric, Fibonacci and exponential distributions lead to anti-uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that, in general, sources with memory are obtained as result of this encoding. For these sources we attach the graph and determine the transition matrix between states, the state probabilities and the entropy. We also compute the average cost for these AUH codes
International audienceThis paper sheds light on universal coding with respect to classes of memoryle...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
Abstract-If optimality is measured by average codeword length, Huffman's algorithm gives optima...
In this paper we address the class of anti-uniform Huffman (AUH) codes, also named unary codes, for ...
6 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes...
11 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) code...
International audienceIn this paper we consider the class of generalized antiuniform Huffman (AUH) c...
International audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for so...
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper h...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
International audienceThis paper sheds light on universal coding with respect to classes of memoryle...
In his classic paper of 1948, Claude Shannon considered the problem of efficiently describing a sour...
In this work we deal with both Coding Theory and Entropy Extraction for Random Number Generators to ...
The aim of this research is to investigate source coding, the representation of information source o...
An extension is presented to the source coding theorem traditionally based on the Shannon entropy an...
International audienceThis paper sheds light on universal coding with respect to classes of memoryle...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
Abstract-If optimality is measured by average codeword length, Huffman's algorithm gives optima...
In this paper we address the class of anti-uniform Huffman (AUH) codes, also named unary codes, for ...
6 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes...
11 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) code...
International audienceIn this paper we consider the class of generalized antiuniform Huffman (AUH) c...
International audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for so...
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper h...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
International audienceThis paper sheds light on universal coding with respect to classes of memoryle...
In his classic paper of 1948, Claude Shannon considered the problem of efficiently describing a sour...
In this work we deal with both Coding Theory and Entropy Extraction for Random Number Generators to ...
The aim of this research is to investigate source coding, the representation of information source o...
An extension is presented to the source coding theorem traditionally based on the Shannon entropy an...
International audienceThis paper sheds light on universal coding with respect to classes of memoryle...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
Abstract-If optimality is measured by average codeword length, Huffman's algorithm gives optima...