Year-end Sale % OFF 
Abstract
In 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
