There are a ton of compression algorithms out there. What you need here is a lossless compression algorithm. A lossless compression algorithm compresses data such that it can be decompressed to achieve exactly what was given before compression. The opposite would be a lossy compression algorithm. Lossy compression can remove data from a file.

May 24, 2011 · My opinion will be, first decide whether you want to do a lossless compression or a lossy compression, then pick an algorithm to implement. Here are a few pointers: Here are a few pointers: For the lossless one, some are very intuitive, such as the run-length encoding, e.g., if there is 11 a s and 5 b s, you just encode them as 11a5b .

Apr 9, 2009 · The smaller the amount of data to compress, the more difficult it is to compress. This problem is common to all compression algorithms, and reason is, compression algorithms learn from past data how to compress future data. But at the beginning of a new data set, there is no "past" to build upon.

Oct 22, 2009 · I want to store a large amount of data onto my Arduino with a ATmega168/ATmega328 microcontroller, but unfortunately there's only 256 KB / 512 KB of EEPROM storage. My idea is to make use of an compression algorithm to strip down the size. But well, my knowledge on compression algorithms is quite low …

Feb 5, 2016 · If you are talking about actually compressing the text not just shortening then Deflate/gzip (wrapper around gzip), zip work well for smaller files and text. Other algorithms are highly efficient for larger files like bzip2 etc. Wikipedia has a list of compression times. (look for comparison of efficiency)

May 8, 2018 · See what is the current state of text-only compression algorithms?. You should also make clear in your question whether you're looking for a comparison among the algorithms you suggested, or generally the most suitable one for the job. In the latter case you have to describe your criteria of "most suitable", e.g., compression ratio, memory ...

Jun 30, 2019 · There is no compression algorithm that can compress all int arrays. Now if you have some statistical properties of your array, you can design some compression algorithm. For images, many work has been done to model their behavior and it is used in standard compression methods. If you need to compress images, use them.

Sep 16, 2014 · I was wondering about how far we can take lossless data compression; I wasn't able to find an online simulator of lossless algorithms to perform some empiric testing. I could just make one on my own, but unluckily I don't have enough time in this period; still I'm curious about an intuition I had, which I'm going to explain.

Oct 25, 2010 · The best compression algorithm definitely depends of the kind of data you are dealing with. Unless if you are working with a list of random numbers stored as a string (in which case no compression algorithm will work) knowing the kind of data usually allows to apply much better algorithms than general purpose ones (see other answers for good ready to use general compression algorithms).

Apr 19, 2012 · This is called LZ77 compression. It is what is implemented by zip, gzip, and zlib using the deflate compressed data format. That format not only references previous string matches, but also uses Huffman compression on the literals (e.g. ABCAD) as …