For discrete memoryless sources with a single-letter fidelity criterion, we study the probability of the event that the distortion exceeds a leveld, if for large block length the best code of given rateR > R(d)is used. Lower and upper exponential bounds are obtained, giving the asymptotically exact exponent, except possibly for a countable set ofRvalues.
No takes yet. Share an insight, caveat, or question.
K. Marton (1974) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: