Skip to main content

All Questions

Filter by
Sorted by
Tagged with
Tooling
0 votes
1 replies
51 views

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 ...
actgroup inc's user avatar
0 votes
2 answers
170 views

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 ...
Eslyn19's user avatar
  • 19
2 votes
1 answer
89 views

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 ...
actgroup inc's user avatar
1 vote
1 answer
146 views

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 ...
aculnaig's user avatar
1 vote
2 answers
135 views

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 ...
TAW_WarDriver's user avatar
0 votes
1 answer
64 views

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,...
Phere Salad's user avatar
0 votes
1 answer
142 views

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. ...
Gary Lucas's user avatar
1 vote
2 answers
231 views

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 ...
459zyt's user avatar
  • 115
1 vote
1 answer
66 views

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 ...
Gaurav Tak's user avatar
0 votes
1 answer
65 views

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 ...
Lorenzo Von Mattherhon's user avatar
-1 votes
1 answer
136 views

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....
Blahblah's user avatar
0 votes
1 answer
57 views

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 ...
Mohi Reza's user avatar
2 votes
2 answers
198 views

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 ...
Евгений Кондратьев's user avatar
0 votes
1 answer
119 views

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 ...
fafu playz's user avatar
0 votes
1 answer
134 views

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 ...
Doruk's user avatar
  • 235

15 30 50 per page
1
2 3 4 5
73