Element recursive collapse compression algorithm and the same element construction compression algorithm (medium)

Copyright NOTICE: Any rights of the algorithm are owned by me, but any developer or organization or group can use this algorithm for development and research, such as the basis of this algorithm to study the new algorithm, but also only need to affirm the source of the basic algorithm, the algorithm commercialization must be done regardless of the use of this algorithm to develop what products, Once the product uses this algorithm, it is necessary to develop the corresponding Chinese version, the Chinese version is required to display more than 95% in Chinese. These terms apply to the algorithm mentioned in this and the previous and next article, if the terms are in conflict with these terms.

We have already made clear the element recursive collapse compression algorithm, in fact, the algorithm is a bit too idealistic, completely dependent on mathematics, if it can be achieved, then the effect is very good, but I also understand his shortcomings, but also the shortcomings of all compression software, that is, no matter how compressed, To a certain compression rate can not be compressed down, the compression of information is limited, because to contain so much information must have the corresponding information carrier, if the carrier is insufficient, then the information can not be lossless.

So, there is no way to solve this problem, the answer is some, but also in essence, since you need so many vectors because you have so much information, then to solve this problem we have to solve the question of the size of the information, if we reduce the information itself, So is it that the carrier of information can be reduced correspondingly? Yes, this concept is easy to understand, so we have to deal with the problem of information, reduce the number of messages to be transmitted, but also to ensure the integrity of the information, well, I admit that this is a very interesting proposition, because it requires us to both balance and not sacrifice to meet the other side, OK, let us solve the problem.

First of all, we have to clear one thing, that is, if it has been packaged, the transmission process we are not possible to operate, because the lost information can never be found, which is contrary to our original intention, so we only in the compression before thinking, what method? Well, we guide, there is a subject called cryptography, specialized in how to use the least carrier to express the most information or with a large number of carriers to hide a piece of information, the latter part of the We do not need to tube, we only need the previous part, right, is to study how to use the least carrier to express the most information. Film and television program there is a bridge section everyone is not unfamiliar, that is not know is the protagonist or the villain to the ground a fall, and then a lot of lictors, of course, the next situation on the children are not suitable .... What can we analyze from this process? First of all, the message is to drop the cup, that is to say we can study the transmission of information, but this is not related to the topic of this article, perhaps one day I will take research, but this article will not. Since it is not the transmission of information, then what is, before this, I ask a question: How lictors know to come out? It is easy to put, hear the cup is the sound of the fall out, then, lictors how to know that the cup is to call them out, the top command, yes, this is the focus, put today, perhaps we often have such an example: Hey, man, I go fishing tomorrow, you go? Good! , beauty, how about I invite you to dinner? OK, so, the night of the intention of the brothers successfully hugged the beauty, and the next day there are many fish unlucky; see here, we analyze these three cases, it is clear that they all have a common denominator, that is beforehand about good, so, we see today's focus: the Agreement! In layman's terms, it is agreed in advance, this agreement in the cryptography that is always used, and the specific rules, there is a nice name, called the password, the password, in the final analysis, is actually a lot of convention set

See here, there is a question, I am studying the compression algorithm, and the password of this kind of thing have what relationship? Not to mention, there is no relationship, but this time can really use, you see AH, the password is a word to the agreement of a word, then the purpose of our compression algorithm is not secrecy but compression, is it possible to contract a word corresponding to multiple words? So we use our agreement to replace, is not to reduce the overall size of information? If the convention is more than can greatly reduce the size of information, the information itself is small compression is not the volume will be smaller? Of course, see here is not a good zip algorithm no difference? If it is, please take a closer look, there is a difference between the two, especially to achieve, the zip data dictionary is generated by the file itself and our agreement is fixed, fixed to whatever file to do compression, is to use the same convention, so that the file will not be transferred to cause the decompression, To know that the data dictionary generated by the zip algorithm is actually put together with the compressed file, and others just re-order your files, there is no intention to fundamentally reduce the size of the information itself.

So why should we use the same convention? Very simple, because we do is to reduce the size of the information itself, that is, in the destruction of the integrity of the information itself, we do lossless compression can not destroy the information itself, so we can only use the same convention, or the password book, of course, if we do so, some of the file compression rate may not reach the requirements, Because his large amount of information is not in our password book, we can not replace the crop, then we have to do is to compress the zip algorithm once, and then to dry, if not, there is another way, the other way this article will not write out, because ... Because after work, hungry to go home to eat ...

Well, write here, you see, my way is to get a fixed password as a data dictionary, and then separate this dictionary, do not write to the file, so you can further reduce the file volume, of course, this is not a complete algorithm, this is just a thought, or part of the idea, Because this article only realizes the substitution/compression between the elements, has not realized the construction, but constructs, is the algorithm key, this algorithm most wonderful, the most special part.

When you have time to write the next article

Element recursive collapse compression algorithm and the same element construction compression algorithm (medium)