Infinite anti-uniform sources

Authors: Daniela G. Tarniceriu, Valeriu B. Munteanu, Gheorghe Zaharia

Abstract:
In this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet. Poisson, negative binomial, geometric and exponential distributions lead to infinite anti-uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as a result of this encoding, we obtain sources with memory. For these sources we attach the graph and derive the transition matrix between states, the state probabilities and the entropy. If c0 and c1 denote the costs for storing or transmission of symbols “0” and “1”, respectively, we compute the average cost for these AUH codes.

Keywords:
Huffman coding
Average codeword length
Code entropy
Average cost

Published in: AEÜ-International Journal of Electronics and Communications (Volume 67, Issue 3, March 2013)

Publisher: Elsevier

ISSN Information: 1434-8411

Infinite anti-uniform sources

Bình luận của bạn

*

*

*

*

 Captcha

Gửi bình luận nhập lại