Cart (Loading....) | Create Account
Close category search window

Asymptotic rate-distortion functions for coding precedence relations (Corresp.)

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

2 Author(s)

An improved analysis for an information system is described in which the input and output alphabets consist of (equiprobable) ordered lists of m items, with two distortion criteria: 1) the fraction of item-pairs found out of order and 2) the fraction of items found in wrong positions. For the former it is shown that, asm rightarrow infty, the rate-distortion functionR_{1} (D)is equivalent tomG(D)with, for smallD,G(D)=log (2/D)-2+ O(D). For the latter,R_{2} (D) = m log m(1 - D) + m(l - D)[log(1 - D) - 1] + o(m).

Published in:

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

Date of Publication:

Jan 1979

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.