Fast approximation to optimal compression of digital data

摘要: A “fast approximation” of compression current data involves using information obtained from an earlier similar data. It overcomes the iterative process discovering a unique set optimal symbols. Representatively, dictionary symbols corresponding to original compressed file is extracted. Original bits are then Sequences identified in under consideration. new bit stream for created and according they represent. Every occurrence counted path-weighted Huffman tree occurrences. coding ensues, along with end-of-file marker. The latter stored file, including extracted file.