By Topic

Efficient Integer Coding for Arbitrary Probability Distributions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shengtian Yang ; Dept. of Inf. Sci. & Electron. Eng., Zhejiang Univ., Hangzhou ; Peiliang Qiu

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 in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 8 )