By Topic

Robust noiseless source coding through a game theoretical approach

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
$31 $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

1 Author(s)

Noiseless coding of a discrete source with partially known statistics is formulated as a two-person game. The payoff is the average codeword length, using Shannon codes. The code designer picks a source probability distribution for the design of the code, while an opponent picks the actual source probability distribution. It is shown that if the class of probability distributions allowed is convex, then there is a saddle point solution which is determined by the maximum entropy distribution of the convex class. The maximum entropy element is derived for three families of source probability mass functions (pmf): a) the class of c-contaminated pmf's; b) the class of pmf's for which each probability is known only through an upper and lower bound; c) the class of pmf's which is a convex hull of a finite number of known pmf's. An extension of the robust noiseless source coding problem for families of sources modeled as first-order Markov chains is discussed.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 4 )