| 摘要 |
<p>The present invention concerns an automated method for compressing, without information loss, a binary string Υ of input data subdivides the input string Υ into words (1) each comprising n bits, it fixes a sorting rule OB=[B0,B1,B2n-1?]=[Bk]k=0,1,2,…,2n-1 of the 2n binary values, which may be assumed by a binary word comprising n bits, in that it segments the input string Υ in order to have Ms distinct segments SEGsi each one of which comprises an integer number SWsi of words (1) having n bits, in that, for each one of the Ms segments obtained from the input string , each being in turn considered as an input string S, assuming that S0 =S, it locates the words having binary value Bk within the string Sk, it stores in an array Ak the distance diBk of each located word with respect to the preceding word having binary value Bk,it juxtaposes to the output string E the elements diBk stored in the array Ak and in that it constructs a string Sk+1 obtained by eliminating from the string Sk the Nk located words.</p> |
