Statistical algorithm of compression of the information

Аuthors

Lobanov S. V.

e-mail: sergey@degunino.net

Abstract

In given article the description of algorithm of coding of rearrangements with the recurrences, compression of the information being statistical algorithm is submitted. Two variants of a method are examined: two passed, demanding a priori knowledge of statistics of a coded sequence, and one passed, forming statistics during work. It is shown asymptotical an optimality of algorithm at increase of length of a sequence. Dependence of time of coding on length of a compressed sequence is resulted. It is informed practical results of modelling of algorithm on the computer.

Download