Year-end Sale % OFF 
Abstract
Performance bounds on the average codeword length of Golomb codes for arbitrary probability distributions are derived in terms of the mean. Then based on Golomb codes, a class of extended gamma codes which are the generalizations of Elias gamma code is constructed and proved to be universal. Optimal decision rules for choosing parameters of Golomb codes and extended gamma codes for arbitrary probability distributions are also derived. Finally, the concept of maximum entropy codes is introduced and the existence of such codes is investigated for source classes with linear constraints. Golomb codes with optimal parameters turn out to be maximum entropy codes for sources with a fixed mean
Published Version
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.
