1,086 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
Tooling
0
votes
1
replies
44
views
How does a Deflate compressor know when to choose Dynamic or Fixed Huffman codes?
I have been following the inner working of Deflate compression and I have came across a junction in which I need
to understand how efficient are compressor's choices with this lossless compression ...
0
votes
2
answers
162
views
How can I store Huffman-encoded bits into a truly compressed binary file in Java?
I'm building a Huffman compressor in Java.
I already have: The original text, the Huffman code table (Map<Character, String>), and the order of character appearance.
My current goal is to write ...
2
votes
1
answer
83
views
Can initial similarity between 2 files create similarity in the start of their Deflate compressed output?
Assuming we have 2 files:
FILE 1
Uncompressed size: 793765 bytes
Compressed size: 604911 bytes
Data type: 99% Base64
Compression method : deflate dynamic
FILE 2
Uncompressed size: 793765 ...
1
vote
1
answer
139
views
Huffman classical and canonical version
I am writing a simple encoder and decoder of a Huffman tree that produces classical and canonical codes after the tree is built.
But no matter what, given an input, it produces always the same result ...
1
vote
2
answers
116
views
Order of Huffman List when there are many characters with the same frequency
I am running into a very interesting dilemma while learning Huffman compression. I am currently studying in a course that uses zyBooks and the examples are absolutely terrible in my opinion. In 2 ...
0
votes
1
answer
59
views
Quick method to merge Huffman Coding tree with repetitive entries
Say I have many repetitive entries that are to be merged into a Huffman Coding tree. Simply merging them would cost n*logn but I want it to be faster. Say I have 100000 entries of the same frequency 1,...
0
votes
1
answer
124
views
When would Huffman coding outperform Deflate?
What features in a data set would lead to Huffman coding outperforming Deflate compression?
I am looking at lossless data compression for numerical raster data sets such as terrestrial elevation data. ...
1
vote
2
answers
194
views
How to differentiate between optimal prefix codes and Huffman codes?
Question
While studying encoding theory, I encountered a set of code tables where I need to determine whether they belong to one of the following categories:
A:Prefix codes
B:Huffman codes
C:Optimal ...
1
vote
1
answer
47
views
Empty Encoder Map but the Huffman tree is generating
So I am making a data compression tool using Huffman Encoding and decoding, I am at the stage where I have built the Huffman Tree and it is a success but I am feeding that tree in a GenerateCodes ...
0
votes
1
answer
56
views
Huffman implementation reduce decompression time
I'm trying to improve the computational speed of this huffman. For small input hex strings its fine but the bigger the input string is the time increments considerably with a large enough string speed ...
-1
votes
1
answer
123
views
Huffman Coding Java
I have this question:
Consider a DMS with seven possible symbols Xi, i = 1, 2, ... , 7 and
the corresponding probabilities p1 = 0.37, p2 = 0.33, p3 = 0.16, p4 =
0.07, p5 = 0.04, p6 = 0.02, and p7 = 0....
0
votes
1
answer
52
views
Understanding the Leaves of Equal Height in a Huffman Tree for an Optimal Set-Based Search Algorithm
I'm studying an algorithm that uses a Huffman tree to find the optimal search cost based on probabilities. Here’s how the algorithm works:
Start by checking the most probable element (X1) to see if ...
2
votes
2
answers
190
views
Huffman's algorithm produces a compressed file that is larger than the original one
I have written this function. It does some magic with the file that I input (the one to compress) - a .txt (text) file, however the output (compressed) file is larger than the original one. For ...
0
votes
1
answer
104
views
Encoding ac and dc cofficients in jpeg compression after zigzag ordering
I'm trying to implement JPEG compression in python and so far I have done the following steps
Color Space conversion
Downscaling chrominance channels
8x8 block splitting ( adds padding if size is not ...
0
votes
1
answer
132
views
How to write already generated Huffman Codes to file in Rust
I am trying to implement Huffman encoding to compress files (for learning purpouses). I can generate Huffman codes for a given message and use that to build a binary string containing the compressed ...