What is Entropy? and its relation to Compression

[@moebius2217]

OMG! How did people miss this fabulous Lecture?

[@rationalthinker9612]

Whoa, I am reading my textbook for Communications Engineering, an EE course, and the book does a terrible job at explaining these concepts. You knocked it out of the park with that explanation, thanks!!!

[@iain_explains]

I'm glad you liked it. Have you seen my web page? It's got a categorised listing of all the videos on the channel. I've got lots more that I'm sure will help with a range of other concepts you're reading about. One of my main motivations in making these videos, is to help explain concepts that can be confusing in textbooks. iaincollings.com

[@safiyajd]

I can’t express how amazing and helpful is the work you are doing! Keep going man, May God lighten your way, satisfy you, and reward you immensely!

[@iain_explains]

Thanks so much. I'm glad the videos have been helpful.

[@_SeaH0rse]

This dude is such a blessing lol, wish I'd found these years ago.

[@arvindp551]

Thank you Professor, you are really good at saving paper and keeping us hungry for in-depth knowledge.

[@iain_explains]

I'm so glad you like the videos.

[@bbanahh]

Excellent work!

[@khanhnguyenviet3674]

Thank you Professor. Your videos are incredibly helpful.

[@iain_explains]

Glad you like them!

[@CuongPhamQ]

Complex concepts are explained by an amazing Professor

[@iain_explains]

So nice of you to say. Thanks.

[@nikhilsachan_cse7144]

best explanation and good example taken

[@iain_explains]

Glad you liked it!

[@JoAna-cg7gx]

Incredibly helpful!

[@iain_explains]

Glad you think so!

[@TheRn35]

Thank you so much for the intuitive understanding!

[@iain_explains]

Glad it was helpful!

[@speedsystem4582]

I love your lectures. It's really helpful. My professor hardly bothers to explain, like in our class, he told us the method to perform Huffman coding without any context! By the way, I observed a slight inconsistency in the video towards the end as you compared the improved coding efficiency on stringing '⍺β'; The 'β' from the previous case is half as likely as ⍺, so if '⍺' is always followed by 'β', both have to equally likely in the previous example

[@iain_explains]

You're right, but the two examples are not the same (and I didn't intend them to be the same) - which is why the latter example can be compressed more (which is the point I was making).

[@gary1951]

Thank you so much for this, basically explain what my professor tried to do... but did so much better.

[@iain_explains]

Glad it helped!

[@2262sandeep]

Wow, this is actually teaching !! Love you Sir, pls record all your knowledge 🙏 ❤

[@iain_explains]

I'm so glad you like the videos.

[@kassiemarq3928]

thank you. you teach better than my professor

[@iain_explains]

Happy to help.

[@HaliFins]

Thanks from Norway!!

[@iain_explains]

Glad you liked the video.

[@gwagsawogbami8938]

what i needed

[@chadx8269]

You are gold.

[@iain_explains]

Thanks. I'm glad you liked the video.

[@zainabiraq9921]

Thanx a lot

[@iain_explains]

Most welcome

[@HavaN5rus]

Good job 👍 Man, you are an amazing teacher!

[@iain_explains]

Thanks. Glad you think so!

[@CuongPhamQ]

Amazing lecturer! Thanks a lot :)

[@iain_explains]

You're very welcome.

[@soxtrae2643]

Great video!

[@iain_explains]

Glad you enjoyed it

[@user-pb8yw8cw3s]

Amazing it's helpful !

[@iain_explains]

Glad to hear that!

[@jerrythomas2046]

Thank you

[@iain_explains]

You're welcome

[@wesleycoleman3781]

Why do Gamma and Delta have to have 3 bits? Couldn't you get away with alpha: 0, Beta:1, Gamma:10, Delta: 11? the average there would be 1.25 bits/symbol wouldn't it?

[@iain_explains]

It needs to be uniquely decodable. With your suggested mapping, if you received a 1, you wouldn't have any way of knowing if it was from a Beta having been sent, or if you needed to wait for the next bit because either Gamma or Delta had been sent.

[@sadeqebrahimi2925]

this is the place that you can learn complex concepts only on one paper of sheet.

[@iain_explains]

Glad you like the format.

[@niividaaaw]

Sir In love with your teaching ! One doubt ( not releated to this video ) What role poles and zeroes play in making a system odd and even,today I read zeros at origin makes the signal odd ! Sir can you xplain sir,it was given as S/(s+1)(s-1) => odd, (s+1)(s-1)/s neither odd nor even (but 2nd one violtes X(s)=X(-s)=>even X(s)=-X(-s)=>odd

[@dimitrisv.1729]

Great work. Keep going!! Could this method of producing the codebook based on entropy value be applied in wireless communications? Because each codeword has not equal bits, overlapping in a sequence of symbols must not be done such us your examples. Ηow such a thing can be avoided with the presence of noise?

[@iain_explains]

Yes, definitely. The codeword length is not the same thing as the frame length, or packet length. The compression encoder takes a sequence of letters/symbols/bits/words (whatever), and converts it into a sequence of 1's and 0's (made up of codewords). That sequence is then divided up into packets according to whatever communication protocol is being used. I plan to make a video soon on source and channel coding, so keep a look out for that.

[@AS-nx9fu]

Why is information an exponential function? Also how does a system map symbols to bits ?

[@iain_explains]

Good question. It is possible to define other "information measures". It doesn't have to be an exponential/logarithmic function, but that function is good because it fits the requirements. The "amount" of information in a message is related to the probability of that message (as discussed in the video). And there are natural boundary conditions: it must equal zero when a message always happens (probability = 1, ie. the message doesn't actually tell you anything you didn't already know, because it always happens, so you were already expecting that message), and it must equal almost infinity when a message almost never happens (probability = 0, ie. those messages are extremely unexpected and surprising, so they are extremely informative when they actually happen), and the function must be continuous between those boundary conditions. The negative log function fits the bill. And as for your question about mapping bits, this video should help: "What is a Constellation Diagram?" kzbin.info/www/bejne/oZetln9qgbZnadU You might also be interested in this video: "What is Fisher Information?" kzbin.info/www/bejne/bmPQoJ-jo7d2nZI

[@AS-nx9fu]

@@iain_explains thanks for the response... appreciate it!!!