Stack Overflow
Stack Overflow

Questions tagged [huffman-code]

Huffman coding is a lossless compression algorithm that is optimal, assuming all input characters are drawn from a known discrete distribution.

Huffman coding is an algorithm that builds a variable-length, prefix-free code for each character in an alphabet based on the frequency of that character. The algorithm works by greedily assembling an encoding tree by combining together encoding trees for individual characters based on their weights. Low-weight trees are combined together until only a single tree remains.

Useful links

1053 questions
-1
votes
2 answers

How to store table into linked list?

So, I've done a little reading and consulted help from a friend. And I think I get it? Actually, my part in the project is just to store the table of characters and frequencies into a linked list. I've written down some codes, so is it possible if…
nutellafella
  • 1
-2
votes
1 answer

Huffman coding prove on a 8 bit sequence

A data file contains a sequence of 8-bit characters such that all 256 characters are about as common: the maximum character frequency is less than twice the minimum character frequency. Prove that Huffman coding in this case is not more efficient…
daniel pns
  • 19
  • 1
  • 3
-2
votes
1 answer

Why do we use trees and not dictionary or hashmaps for Huffman Compression?

Why do we create a Huffman Tree and not just use a dictionary to compress the file? I believe we could do the same using a dictionary but was unable to find an implementation of Huffman Compression using only a dictionary. Neither was able to answer…
Pritesh Kulshreshtha
  • 1
-2
votes
1 answer

'str' object has no attribute 'append' for append node

I'm doing project on huffman coding and this happen 'str' object has no attribute 'append' node[pos].append("0") while len(letters)>0: nodes.append(letter[0:2]) letters = letters[2:] nodes.sort() huffman_tree =…
Saruttaya Wongardam
  • 1
-2
votes
1 answer

How to Merge huffman and lz77?

I have huffman and lz77 codes, but I need any way to merge this algorithms to make deflate How i can do this? I have to write it manually without using libraries.
Mohamad1299
  • 1
  • 1
-2
votes
1 answer

Huffman Tree decoding

Given a Huffman tree and a stream of bits, return a pair containing (1) the -- string of symbols encoded by the bits (according to the Huffman tree), and -- (2) a Bool indicating whether the output stream contains every bit from the -- input (that…
Lmmmmmmc
  • 87
  • 2
-2
votes
2 answers

Is it possible to compress binary files with Huffman-encoding?

My homework for summer is writing a huffman compression program. I searched a lot, but i don't know we can use it for every file format or just for text files. i think it's possible, but rather i ask here.
marcellnemeth
  • 27
  • 1
  • 3
-2
votes
1 answer

modification in huffman coding

When I was studying huffman coding, I faced a problem while dealing with priority queue. Since I am not So good at cpp Please help. Here is the code I tried to make some changes that I have learned so far in cpp. In above cpp program I changed…
user451
  • 1
-2
votes
1 answer

How to use this Huffman coding implementation?

I have found this Literate Haskell snippet implementing Huffman coding, but I don't understand how to use it. Some functions make sense to me—for example, I can write: a = freqList "lol" build list a But how can I compute the Huffman encoding of…
Titamik
  • 23
  • 2
-2
votes
1 answer

How to encode with actual bits in Python?

I have built a huffman encoder in Python, but because I'm storing the bits (which represent the characters) as strings, the encoded text is larger than the original. How can I use actual bits to compress text properly?
sid jones
  • 7
-2
votes
1 answer

fprintf(long) writes 8 bytes and fscanf(long) reads 6 bytes why?

I'm writing a Huffman algorithm and when I write my file header, I store the length of my file because there will be some spare bits and I need to know where to stop. This happens instead when I write the length of my file: It writes 8 bytes, but…
Christian Trisolini
  • 21
  • 4
-2
votes
1 answer

Differentiating Binary Header and Encoded Binary In Huffman

I'm creating a basic Huffman encoding/decoding tool. I've found this question which helped me implement a header that stores my generated huffman tree in binary form. I can also use the tree to encode/decode a text into a binary file as well. So the…
Pomacanthidae
  • 207
  • 1
  • 3
  • 8
-2
votes
1 answer

How to save the values from a Huffman coding

I'm doing a Huffman compression in C++ using OpenCV, I already have the codes for the tones of grey but I'm confused about what to do with it. Is there a way to replace the values in the image? Do I have to create other mat? P.S. My Huffman codes…
Breno Gabrich
  • 1
  • 2
-2
votes
3 answers

Does Huffman Encoding necessarily result in a balanced binary tree?

Huffman encoding uses probability of occurrences of each value, to construct a tree where the values are the leaves. The path length from root to a leaf is least for most probably occurring values. Is the tree constructed (ignoring the assignment of…
Amogh
  • 19
  • 4
-2
votes
2 answers

How to calculate Huffman code length without generating the actual huffman code

Given a vector V in Matlab I want to calculate the code length without generating the code... v = [0.1,0.1,0.1,0.2,0.2,0.3]; the code length = 17. How can I calculate it without generating the code. Thanks
Maroun Sassine
  • 319
  • 5
  • 14
1 2 3
…
70 71