In this given problem we didn't have that information, but in practice, you could you get better compression if you did it with letter sequences (in stead of individual letters), similar to what the other guy was doing for his english speaking machines, correct?
I think so. Lets say you have a very predictable message that contains only 4 different sentences, you can encode them in much fewer bits than if you have each sentence as an option.
Cam Murray makes all the music. He's posted a collection here: cameronmichaelmurray.bandcamp.com/album/art-of-the-problem-volume-1-gambling-with-secrets you can also bug him there about making a 2nd for this series
John Sherfey No, you can't. Huffman coding creates a prefix-free code. That means that the code for one symbol can't be the prefix for another. Having A: 1, and C: 10 violates this
Link to series playlist: ua-cam.com/play/PLbg3ZX2pWlgKDVFNwn9B63UhYJVIerzHL.html
I cannot believe how well that was explained. I've not done much searching for explanations for Huffman, but this really makes it easy to understand.
Wonderful video, I was trying to learn huffman codes from a book, but could not get my mind around it. but this explanation is superb
Great video. Awesome to see a new upload from you
Love the music
It's also impressing and informative.
Thank you.
awsome videos lovem
YES YES YES YES! These are soo good!
How do we know the probabilities practically. In case of mobile communication. Each time the information changes
In this given problem we didn't have that information, but in practice, you could you get better compression if you did it with letter sequences (in stead of individual letters), similar to what the other guy was doing for his english speaking machines, correct?
I think so. Lets say you have a very predictable message that contains only 4 different sentences, you can encode them in much fewer bits than if you have each sentence as an option.
Hi. Could you please list the music you used as soundtrack for your videos? I like dissonance :).
Cam Murray makes all the music. He's posted a collection here: cameronmichaelmurray.bandcamp.com/album/art-of-the-problem-volume-1-gambling-with-secrets you can also bug him there about making a 2nd for this series
Ah, great! Thanks.
What is the simulation shown at 3:22 is it online?
Yes I have it here: www.khanacademy.org/math/applied-math/informationtheory/moderninfotheory/p/information-entropy-exploration
Art of the Problem Thanks :)
Could you do ?
A: 1
B : 01
C : 10
D : 00.
John Sherfey No, you can't. Huffman coding creates a prefix-free code. That means that the code for one symbol can't be the prefix for another. Having A: 1, and C: 10 violates this
dongiea how?
dongiea d is 00 not 0 so c 10 no 100 = AD?
dongiea also to correct you and my self 1001 would have an error. is it Ada or bc