| 摘要 |
The invention relates to a cyclic form of compression that does not depend upon the form of data being compressed. An initial data sequence undergoes a first level of compression and that compressed data can itself undergo a further level of compression. The compression continues in this cyclic manner until a highly compressed final data sequence is achieved. A separate index is used to indicate the level of compression, i.e. the number of cycles performed. Decompression essentially involves reversing the compression method. The compression/de compression technique is based on an algorithm, named the "PIAT Method" (403), which finds and manipulates the coefficients of polynomials. It starts with an initial or generator polynomial and governs the generation of associated polynomials. It is possible to "jump" from the initial data sequence to the highly compressed data without calculating any of the intervening levels of compression. The compressed final data sequence is essentially an encrypted form of the initial data, with the index serving as a decryption key.
|
