By Topic

An application of rate-distortion theory to a converse to the coding theorem

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)

A lower bound to the information rateR(D)for a discrete memoryless source with a fidelity criterion is presented for the case in which the distortion matrix contains the same set of entries, perhaps permuted, in each column. A necessary and sufficient condition forR(D)to equal this bound is given. In particular, if the smallest column element is zero and occurs once in each row, then there is a range ofD, 0 leq D leq D_{1}, in which equality holds. These results are then applied to the special case ofd_{ij}= 1 - delta_{ij}, for which the average distortion is just the probability of incorrectly reproducing the source output. We show how to constructR(D)for this case, from which one can solve for the minimum achievable probability of error when transmitting over a channel of known capacity.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 1 )