Loading [a11y]/accessibility-menu.js
Asymptotic rate-distortion functions for coding precedence relations (Corresp.) | IEEE Journals & Magazine | IEEE Xplore

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


Abstract:

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 distortio...Show More

Abstract:

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: IEEE Transactions on Information Theory ( Volume: 25, Issue: 1, January 1979)
Page(s): 80 - 82
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.