Abstract
A fundamentally new algorithm for data compression is considered. A theoretical basis is provided for the formation, modification, and conversion of data positions aimed at their reversible compression. The specifics are described of a method development based on structure encryption, i.e., reformatting the architecture of the compressed data alphabet based on the positionality and conditionality properties of the compression level and the structural numbering of the reformatted alphabet’s architecture in a positional multilevel space. We substantiate the principle of redundancy reduction due to the following: the simultaneous modification of the positions inhibiting the appearance of noninteger values of new positions and constraints on the digit capacity of the elements in positioning arrays, the identification of the carriers of stabilizing elements in the digital space, and the reduction of the positions with code combinations in the course of the array processing. A particular case of a data conversion protocol is presented. Problems are solved of combining the principles of data reversibility and supercompression both in the modes of single and multiple use of one and the same encryption scenario. The cost of the positioning processes and their influence on the efficiency of the processes of the data encoding and decoding have been determined.
Similar content being viewed by others
References
Olifer, V.G. and Olifer, N.A., Komp’yuternye seti. Printsipy, tekhnologii, protokoly, (Computer Networks. Principles, Technologies, Protocols), St. Petersburg: Piter, 2006.
Wallace, G.K., The JPEG Still Picture Compression Standard, Commun. ACM, 1991, no. 4, pp. 31–34.
Slobodyanyuk, A.V., Methodology of Analysis of Approaches According to Reduction of Redundancy of Images with the Different Degree of Reliability in Information-Telecommunication Systems, Sist. Upr., Navigats. Zv’yazku, Kiev: TsNDI NU, 2008, no. 4, pp. 158–160.
Shannon, C.E., A Mathematic Theory of Communications, Bell Syst. Techn. J., 1948, vol. 27, no. 10, pp. 623–656.
Russ, J.C., The Image Processing Handbook, New York: CRC, 2002.
Costanzo, A., Robinson, D., and Ullmann, R., Encoding Header Field for Internet Messages, Network Working Group J., 1993, pp. 1–36. http://portal.acm.org/citation.cfm?id=RFC1505
Kou, W.K., Digital Image Compression, Washington: Springer-Verlag, 1995.
Huffman, D.A., A Method for the Construction of Minimum-Redundancy Codes, Proc. IRE, 1952, vol. 40, pp. 1098–1101.
Ziv, J. and Lempel, A., A Universal Algorithm for Sequential Data Compression, IEEE Trans. Inf. Theory, 1977, vol. 23, pp. 337–343.
Welch, T.A., Technique for High-Performance Data Compression, IEEE Computer, 1984, vol. 17, pp. 8–19.
Rissanen, J. and Langdon, G.G., Arithmetic Coding, IBM J. Res. Develop., 1979, vol. 23, pp. 149–162.
Stout, Q.F., Improved Prefix Encodings of the Natural Numbers, IEEE Trans. Inf. Theory, 1980, vol. 26, pp. 607–609.
Kasumov, N.K., Suleimanov, A.Sh., and Damadaev, M.M., New View on Compression of Information Flows, Uchenye Zapiski NAA, 2002, vol. 4, no. 1, pp. 11–15.
Kasumov, N.K., Conplex of Cryptographic Systems as Foundation for Loss-Free Data Packing, Sist. Upravl. Inform. Tekhnol., 2006, no. 3(25), pp. 74–79.
Kasumov, N.K., The Universal Coding Method in the Data Compression Algorithm, Autom. Cont. Comp. Sci., 2010, vol. 44, pp. 279–286.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.K. Kasumov, 2012, published in Avtomatika i Vychislitel’naya Tekhnika, 2012, No. 5, pp. 58–69.
About this article
Cite this article
Kasumov, N.K. Data positioning as an instrument of constructive data compression. Aut. Control Comp. Sci. 46, 223–231 (2012). https://doi.org/10.3103/S0146411612050033
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411612050033