Skip to main content
SpringerLink
Log in

A cryptographic tool as an emulator of loss-free data compression procedures

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

Abstract

An essentially new algorithm for constructive data compression is considered. The base components in the operation of the new model are indicated. A complex of cryptographic content transformation systems supports procedural evaluation of data packing procedures in the solution of problems of compatibility of the principles of constructivism and hypercompression in processes that arise in the compression of digital information.

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 Mathematical Theory of Communication, Bell Systems Techn. J., 1948, vol. 27, no. 7, pp. 379–423; no. 10, pp. 623–656.

    MathSciNet  Google Scholar 

  2. Shafazand, M. H. and Tjoa, A. M., Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme, in Eurasia-ICT 2002: Information and Communication Technology, (Lecture Notes in Computer Science, 2002, vol. 2510, pp. 127–134).

  3. Rubin, F., Cryptographic Aspects of Data Compression Codes, Cryptologia, 1979, vol. 3, pp. 202–205.

    MATH  Google Scholar 

  4. Jones, D. W., Applications of Splay Trees to Data Compression, Comm. ACM, 1988, vol. 31, pp. 996–1007.

    Article  Google Scholar 

  5. Vatolin, D. S., Media Data Compression, CS MSU Graphics and Media Lab (Video Group), Moscow State University, 2003.

  6. Russ, J. C., The Image Processing Handbook, Boca Raton: CRC, 2002.

    Google Scholar 

  7. Costanzo, A., Robinson, D., and Ullmann, R. Encoding Header Field for Internet Messages, Network Working Group, RFC 1505, August, 1993.

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

    Article  Google Scholar 

  9. Ziv, J. and Lempel, A., A Universal Algorithm for Sequential Data Compression, IEEE Trans. Inf. Theory, 1977, vol. 23(3), pp. 337–343.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  11. Vatolin, D., Ratushnyak, A., Smirnov, M., and Yukin, V., Metody szhatiya dannyikh (Methods of Data Compression), Moscow State University, 2002.

  12. Kasumov, N. K., The Notion of Constructivism in Processes of Hypercompression of Differently Formatted Content, Izv. Nats. Akad. Nauk Azerbaijana, 2004, vol. 24, no. 3, pp. 30–34.

    Google Scholar 

  13. Kasumov, N. K., Suleimanov, and Damadaev, M. M., A New Approach to Compression of Information Flows, Uch. Zap. Nats. Akad. Nauk Azerbaijana, 2002, vol. 4, no. 1, pp. 11–15.

    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, AZ-1141, Azerbaijan

    N. K. Kasumov

Authors
  1. N. K. Kasumov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © N.K. Kasumov, 2007, published in Avtomatika i Vychislitel’naya Tekhnika, 2007, No. 1, pp. 76–81.

About this article

Cite this article

Kasumov, N.K. A cryptographic tool as an emulator of loss-free data compression procedures. Aut. Conrol Comp. Sci. 41, 54–58 (2007). https://doi.org/10.3103/S0146411607010087

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Search

Navigation