DocumentCode :
919539
Title :
On functionals satisfying a data-processing theorem
Author :
Ziv, Jacob ; Zakai, Moshe
Volume :
19
Issue :
3
fYear :
1973
fDate :
5/1/1973 12:00:00 AM
Firstpage :
275
Lastpage :
283
Abstract :
It is shown that the rate-distortion bound (R(d) \\leq C) remains true when -\\log x in the definition of mutual information is replaced by an arbitrary concave (cup) nonincreasing function satisfying some technical conditions. Examples are given showing that for certain choices of the concave functions, the bounds obtained are better than the classical rate-distortion bounds.
Keywords :
Mutual information; Rate-distortion theory; Channel capacity; Codes; Decoding; Density measurement; Distortion measurement; Information theory; Jacobian matrices; Mutual information; Rate-distortion; Turning;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1973.1055015
Filename :
1055015
Link To Document :
بازگشت