"Compression B" digital computer data compression processcBCP (BCP for basis, combination, product) is a coding / compression process suitable for any computer document, with infinite theoretical compression ratio and lossless.On the basis of (b) natural integer, the original binary code of the document is encoded and compressed intoBit, indicating the number of boxes where there is a bit called "research bit" and labeled "be". The number is marked "NBE".According to the NBE value, compression can be divided into three stagesStage 1 = = Be studies simple block coding of bit.Stage 2 = = The box of be research bit is coded according to combination number.Stage 3 = = The blocks of be research bits are coded according to the product number of these blocks, and the product is decomposed into prime factors.For B ≥ 8, each binary sequenceBits can be encoded / compressed to less thanBit.The larger the base B is, the larger the bit gain is.In particular: 25% based on 10 (in thousand order)50% based on 20 (megabit order)75% based on 30 (about Gigabit)Since the existential frame of be research bit is known, the existential frame of the second bit is deduced through complementarity.Considering the inherent characteristics of coding (compressing binary sequence to lower binary sequence), the repetition of the process can be carried out according to the required number of times, so the theoretical property of compression is infinite.Therefore, when the original file tends to infinity, the theoretical compression ratio tends to infinity.Coding calculation only involves the arithmetic operation of natural integers (there is no approximate compression, so there is no loss).The special coding / compression case must come from the operation of this "compression-b C P" method.
展开▼