The ability to find short representations, i.e. to compress data, is crucial for many intelligentsystems. This paper is devoted to data compression and a transform-based quantitative data compressiontechnique involving quick enumeration in a unary-binary time-based numeral system (NS). The symbolscomprising the alphabets of human-computer interaction languages (HCIL), which are used in an informationalmessage (IM), are collected in primary code tables, such as the ASCII table. The statistical-oriented datacompression method using unconventional timer encryption and encoding information are proposed by us. Itwas constructed probability - discrete model of the set of character sequences and characterized someprobabilistic algorithms associated with the recovery of text by its public key and its cipher. We find thepossibility of parallel implementation of this method by building a block of timer tags. The necessaryestimations of complexity are obtained. The method can be used to compress SMS messages. Probabilisticstatistical analysis and evaluation of their effectiveness are obtained.
The Timer Inremental Compression of Data and Information
