text-compression | 易学教程

Compressing small piece of data

阅读更多关于 Compressing small piece of data

问题 I have a buffer of let's say 4KB, containing data in JSON-like format. I need to add significantly more information (up to let's say 3x more) to it, but I have to fit in this small chunk of memory. I was thinking about using libZ to compress text, but I'm afraid it will not perform well since the data consists mostly of some unique substrings. What would you recommend in this situation? Thanks, Chris 回答1: Consider a fixed dictionary containing up to 32K of strings that you expect to appear in

What is the current state of text-only compression algorithms?

阅读更多关于 What is the current state of text-only compression algorithms?

问题 In honor of the Hutter Prize, what are the top algorithms (and a quick description of each) for text compression? Note: The intent of this question is to get a description of compression algorithms, not of compression programs. 回答1: The boundary-pushing compressors combine algorithms for insane results. Common algorithms include: The Burrows-Wheeler Transform and here - shuffle characters (or other bit blocks) with a predictable algorithm to increase repeated blocks which makes the source

TEXT compression in python

阅读更多关于 TEXT compression in python

问题 I have this text : 2,3,5,1,13,7,17,11,89,1,233,29,61,47,1597,19,37,41,421,199,28657,23,3001,521,53,281,514229,31,557,2207,19801,3571,141961,107,73,9349,135721,2161,2789,211,433494437,43,109441,139,2971215073,1103,97,101,6376021,90481,953,5779,661,14503,797,59,353,2521,4513,3010349,35239681,1087,14736206161,9901,269,67,137,71,6673,103681,9375829,54018521,230686501,29134601,988681,79,157,1601,2269,370248451,99194853094755497,83,9521,6709,173,263,1069,181,741469,4969,4531100550901,6643838879,761

What is the current state of text-only compression algorithms?

阅读更多关于 What is the current state of text-only compression algorithms?

In honor of the Hutter Prize , what are the top algorithms (and a quick description of each) for text compression? Note: The intent of this question is to get a description of compression algorithms, not of compression programs. Corbin March The boundary-pushing compressors combine algorithms for insane results. Common algorithms include: The Burrows-Wheeler Transform and here - shuffle characters (or other bit blocks) with a predictable algorithm to increase repeated blocks which makes the source easier to compress. Decompression occurs as normal and the result is un-shuffled with the reverse