Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
Hi-index | 754.84 |
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.