Terra压缩是否可能?如果是这样，请说明并提供样品 [英] Is Terra Compression possible? If so, please explain and provide samples

问题描述

通过使用复杂的数学公式/算法，可以将长Ascii字符串文本压缩或压缩为哈希类型的ascii校验和"，也可以不将其压缩.就像可以压缩的空气一样.

Long Ascii String Text may or may not be crushed and compressed into hash kind of ascii "checksum" by using sophisticated mathematical formula/algorithm. Just like air which can be compressed.

通过混洗将兆字节的ascii文本压缩为128个字节左右，然后从头到尾依次轮流混合单个字节"的新模式".在解压缩时，首先提取最后一个字符，然后使用从最后到第一个的公式和顺序键进行解压缩.必须确切知道顺序键以及最后一个字节和第一个字节，包括完全更新的最终编译字符串以及压缩的字节总数.

To compress megabytes of ascii text into a 128 or so bytes, by shuffling, then mixing new "patterns" of single "bytes" turn by turn from the first to the last. When we are decompressing it, the last character is extracted first, then we just go on decompression using the formula and the sequential keys from the last to the first. The sequential keys and the last and the first bytes must be exactly known, including the fully updated final compiled string, and the total number of bytes which were compressed.

这是我正在考虑的terra压缩.这可能吗?你能解释例子吗?我正在研究这个理论，这是我自己的想法.

This is the terra compression I was thinking about. Is this possible? Can you explain examples. I am working on this theory and it is my own thought.

推荐答案

一般吗?绝对不会.

对于某些特定情况?是的.一兆字节的仅由空格组成的ASCII文本可能压缩得非常好.真实文本通常会很好地压缩 ……但不会以几兆字节的顺序压缩为128字节.

For some specific cases? Yup. A megabyte of ASCII text consisting only of spaces is likely to compress extremely well. Real text will generally compress pretty well... but not in the order of several megabytes into 128 bytes.

请考虑可以容纳几兆字节的字符串，甚至包括有效英语单词的字符串.远远超过256 ^ 128.根据信鸽原理，它们不能全部压缩到128个字节...

Think about just how many strings - even just strings of valid English words - can fit into several megabytes. Far more than 256^128. They can't all compress down to 128 bytes, by the pigeon-hole principle...

这篇关于Terra压缩是否可能?如果是这样，请说明并提供样品的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！