DocumentCode :
1311700
Title :
On list size exponents in rate-distortion coding
Author :
Merhav, Neri
Author_Institution :
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
Volume :
43
Issue :
2
fYear :
1997
fDate :
3/1/1997 12:00:00 AM
Firstpage :
765
Lastpage :
769
Abstract :
We characterize and investigate the highest achievable exponential growth rate of the expected number of rate-distortion codewords that are within a certain distance from a given source vector
Keywords :
exponential distribution; memoryless systems; rate distortion theory; source coding; codewords; exponential growth rate; list size exponents; lossy source coding; memoryless sources; rate-distortion coding; source vector; Codes; Decoding; Distortion measurement; H infinity control; Network address translation; Random variables; Rate distortion theory; Rate-distortion; Redundancy; Source coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.556137
Filename :
556137
Link To Document :
بازگشت