Skip to main content
SpringerLink
Log in

Three-criterion model of coding as a guarantee of lossless compression of content

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

An essentially new algorithm of constructive data compression is considered in the present article. The base components in the operation of the new model are specified. It is shown that procedural evaluation of the data packing procedures in the solution of problems involved in combining the principles of constructivism and guaranteed hyper-reduction in processes of digital information compression is supported on the base of a three-factor model of content transformation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Shannon, C.E., A Mathematic Theory of Communications, Bell Systems Tech. J., 1948, vol. 27, no. 7, pp. 379–423; no. 10, pp. 623–656.

    MathSciNet  MATH  Google Scholar 

  2. Russ, J.C., The Image Processing Handbook, CRC Press, 2002.

  3. Costanzo, A., Robinson, D., and Ullmann, R., Encoding Header Field for Internet Messages, Network Working Group, 1993.

  4. Kou, W.K., Digital Image Compression, Springer, 1995.

  5. Huffman, D.A., A Model for the Construction of Minimum-Redundancy Codes, Proc. IRE, 1952, vol. 40, pp. 1098–1101.

    Article  Google Scholar 

  6. Ziv, J. and Lempel, A., A Universal Algorithm for Sequential Data Compression, IEEE Trans. Information Theory, 1977, vol. 23, pp. 337–343.

    Article  MATH  MathSciNet  Google Scholar 

  7. Welch, T.A., Technique for High-Performance Data Compression, IEEE Computer, 1984, vol. 17, pp. 8–19.

    Google Scholar 

  8. Rissanen, J. and Langdon, G.G., Arithmetic Coding, IBM J. Res. Develop., 1979, vol. 23, pp. 149–162.

    Article  MATH  MathSciNet  Google Scholar 

  9. Stout, Q.F., Improved Prefix Encoding of the Natural Numbers, IEEE Trans. Inform. Theory, 1980, vol. IT-26, pp. 607–609.

    Article  MathSciNet  Google Scholar 

  10. Kasumov, N.K., Conception of Constructivism in Processes of Supercompression of Differently Formatted Content, Izv. Nats. Akad. Nauk Azerb., 2004, vol. 24, pp. 30–34.

    Google Scholar 

  11. Kasumov, N.K., A Cryptographic Apparatus as an Emulator of Lossless Data Compression Procedures, Avtom. Vychisl. Tekh. (Riga), 2007, no. 1, pp. 76–81 [Autom. Control Comput. Sci. (Engl. Transl.), 2007, no. 1].

  12. Kasumov, N.K., Suleymanov, A.Sh., and Damadaev, M.M., A New View of Compression of Information Flows, Uchen. Zap. Nats. Akad. Azerb., 2002, vol. 4, pp. 11–15.

    Google Scholar 

  13. Kasumov, N.K., Suleymanov, A.Sh., and Damadaev, M.M., A Method of Stepwise Data Compression for Archiving of Files and Packing of Disks, Uchen. Zap. Nats. Akad. Azerb., 2002, vol. 4, pp. 20–23.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Technologies, National Academy of Sciences of Azerbaijan, ul. F. Agaeva 9, Baku, Az1141, Azerbaijan

    N. K. Kasumov

Authors
  1. N. K. Kasumov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. K. Kasumov.

Additional information

Original Russian Text © N.K. Kasumov, 2007, published in Avtomatika i Vychislitel’naya Tekhnika, 2007, No. 5, pp. 77–82.

About this article

Cite this article

Kasumov, N.K. Three-criterion model of coding as a guarantee of lossless compression of content. Aut. Conrol Comp. Sci. 41, 294–297 (2007). https://doi.org/10.3103/S0146411607050094

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411607050094

Key words

Search

Navigation