No label defined (Q3744087)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3978974
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3978974

      Statements

      0 references
      0 references
      1985
      0 references
      Distortion-free compressibility
      0 references
      two-dimensional arrays of data
      0 references
      finite- state encoders
      0 references
      individual infinite picture
      0 references
      compression-ratio
      0 references
      constructive coding theorem
      0 references
      data-compression
      0 references
      picture-compressibility
      0 references
      universal compression-scheme
      0 references
      [For the entire collection see Zbl 0564.00027.] Distortion-free compressibility of individual pictures, i.e., two- dimensional arrays of data, by finite-state encoders is investigated. For every individual infinite picture I, a quantity \(\rho\) (I) is defined, called the compressibility of I, which is shown to be the asymptotically attainable lower bound on the compression-ratio that can be achieved for I by any finite-state, information-lossless encoder. This is demonstrated by means of a constructive coding theorem and its converse that, apart from their asymptotic significance, might also provide useful criteria for finite and practical data-compression tasks. The proposed picture- compressibility is also shown to possess the properties that one would expect and require of a suitably defined concept of two-dimensional entropy for arbitrary probabilistic ensembles of infinite pictures. While the definiton of \(\rho\) (I) allows the use of different machines for different pictures, the constructive coding theorem leads to a universal compression-scheme that is asymptotically optimal for every picture. The results of this paper are readily extendable to data arrays of any finite dimension. The proofs of the theorems will appear in a forthcoming paper.
      0 references

      Identifiers