Abstract
Distortion-free compressibility of individual pictures by finite-state encoders is investigated. In a recent paper [2], the compressibility of a given picture I was defined and shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved for I by any finite-state encoder. In this paper, a different and more direct approach is taken to prove similar results, which are summarized in a converse-to-coding-theorem and a constructive-coding-theorem that leads to a universal and asymptotically optimal compression algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
