Abstract
The object of research is the methods of compressive coding, which are used for economical presentation of data in information systems. Compression methods can be used at various stages of data processing, in the transmission of messages and their storage. One of the most problematic places for the application of compression methods are high requirements for computing resources, significant hardware and software costs for their implementation and low coding/decoding speed. In this case, of particular interest are methods, on the results of compression of which computational operations are possible without reversing them.Within the framework of the approach, when at the basis of any code it is possible to detect a structural number system, mathematical models of compression based on binary binomial numbers are developed. In the structure of sequences, the corresponding binomial numbers are determined on the basis of systems of code-forming constraints. As a result, each combination is assigned a binomial number, which is its compressed image.In the course of the study, theorems on a one-to-one correspondence between the initial sequences and binary binomial numbers are formulated, which demonstrate how to implement mappings based on simple analytical relations. The examples given confirm the simplicity of the transformations under compression coding and decoding.The models of the processes of compression and recovery are obtained, which are characterized by a small number of simple operations. As a result, the considered methods are characterized by high speed with good compression ratios. At the same time, the amount of hardware and software costs in practical implementation is small. An additional positive effect is that compressed images have the properties of numbers.The research results demonstrate the effectiveness of the use of compression based on binary binomial numbers in information systems in order to increase their productivity and reduce the cost of data processing. At the same time, compared with similar known methods, there are minimal costs for their implementation when achieving a high conversion rate and a good degree of compression of binary data of any kind.
Highlights
The use of compressive data coding aims, first of all, to increase the productivity of information systems, among which computerized control systems, data archiving systems, distributed databases, etc. can be attributed
Compressing information allows one to achieve performance in two ways [1, 2]: 1) reducing the time spent on the transmission of in formation by communication channels; 2) increasing in memory capacity to store information that is used in the system
A mathematical model is constructed for the me thod of compressing equilibrium combinations on the basis of binary binomial numbers
Summary
The use of compressive data coding aims, first of all, to increase the productivity of information systems, among which computerized control systems, data archiving systems, distributed databases, etc. can be attributed. The use of compressive data coding aims, first of all, to increase the productivity of information systems, among which computerized control systems, data archiving systems, distributed databases, etc. Compressing information allows one to achieve performance in two ways [1, 2]: 1) reducing the time spent on the transmission of in formation by communication channels; 2) increasing in memory capacity to store information that is used in the system. Improving the performance of the system, according to the first direction, is that over the same period of time, the amount of information that is transmitted over the communication channel increases. The in formation system is able to process more data for the same period of time. According to the second direction, an increase in the performance of an information system is possible due to:
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
