Skip to main content

Questions tagged [compression]

The name given to the process of encoding data such that it uses lesser number of bits as compared to the original representation.

19 votes
2 answers
35k views

Since rsync lacks compression and I'm not a big fan of rdiff, I thought I'd try my own little backup script. Since I'm very ...
magu_'s user avatar
  • 938
16 votes
1 answer
5k views

I think understanding basic data compression and pattern finding / entropy reduction primitives is really important. Mostly the basic algorithms (before the many tweaks and optimizations are made) are ...
Cris Stringfellow's user avatar
16 votes
1 answer
5k views

I have a large array (around 1 MB) of type unsigned char (i.e. uint8_t). I know that the bytes in it can have only one of 5 ...
avikpram's user avatar
  • 171
13 votes
4 answers
4k views

I attempted a problem from the Cracking the Coding Interview book. The following input: aabcccaaa should give the following output: ...
user avatar
13 votes
2 answers
626 views

I'm relatively new to Python 3, especially IO programming, writing a Blender add-on to import model data. The model data is available in a custom compression, and I originally wrote code in C# to ...
Ray's user avatar
  • 233
13 votes
1 answer
5k views

Here is a simple decompression implementation. I'd very much appreciate any advice or comments about the structure/logic of the program, style of the code, or reusability of the features. I'm a real ...
SuddenMoustache's user avatar
12 votes
3 answers
3k views

I've been trying to implement a fast Huffman decoder in order to encode/decode video. However, I'm barely able to decode a 1080p50 video using my decoder. On the other hand, there are lots of codecs ...
ronag's user avatar
  • 596
12 votes
3 answers
62k views

I'm looking for code review, optimizations, best practices. ...
JavaDeveloper's user avatar
12 votes
3 answers
6k views

In a past course one of the assignments was to write a program that can compress files using Huffman Tree algorithm, and uncompress the files that the program generates. My design is to count the ...
iBug's user avatar
  • 263
12 votes
1 answer
3k views

This is a c++11 implementation of Huffman-encoding that I wrote as a hobby. My main goal in writing it was to get more accustomed to c++11 and STL in general, as well as stuff like bit-manipulation. ...
DJMcMayhem's user avatar
11 votes
3 answers
2k views

Introduction I have this small C++ program that packs a DNA string over alphabet ACGT into a bit vector, two bits per character. Code dnapack.hpp ...
coderodde's user avatar
  • 32.3k
11 votes
4 answers
33k views

My task was to implement a method which performs basic string compression by counting sequences of repeating characters. Given "aaabbbccc" it should return ...
user137717's user avatar
11 votes
1 answer
22k views

It's a simple version of LZW compression algorithm with 12 bit codes. I want to know what's good and what's bad about this code. Be as picky as you like. ...
robtwentyfour's user avatar
11 votes
2 answers
2k views

The Huffman-Algorithm The Huffman-Algorithm, named after David A. Huffman who first published this algorithm in 1952, is a algorithm for lossless data compression. As most encoding-methods, the words ...
user avatar
10 votes
3 answers
2k views

This is an update to a question I posed nearly two years ago about my implementation of Huffman Coding which I had written in C. Since then I have had time to grow as a programmer and have managed to ...
jess's user avatar
  • 1,388

15 30 50 per page
1
2 3 4 5
14