Sir your tutor is amazing. But many students are not benefiting from it. So for you to help them find your tutor please first add profile to your youtube channel and for your videos add thumbnails on it.
Since all the probabilities add up to 1 would it be possible to suppress the last element from the transmission and let the receiver compute the missing one by subtracting the sum of what has been recovered from 1 ?
This is incomparably better than explanations given in my lectures and textbook. Thanks!
It does really simplified my understanding of the algorithm and it's recursive work. Thank you so much
love your tutorials.....
really nice tutorial video!
Sir your tutor is amazing.
But many students are not benefiting from it. So for you to help them find your tutor please first add profile to your youtube channel and for your videos add thumbnails on it.
How do you precompute entropy? (philosophically & mathematically plz)
Since all the probabilities add up to 1 would it be possible to suppress the last element from the transmission and let the receiver compute the missing one by subtracting the sum of what has been recovered from 1 ?
Thank you so much sir. You actualy help for my exam
So the most repeated item does not have the smallest number of bits ?
What is B=2 and A={0,1} here and their significance?
+Nick Royal -sum[Pi log Pi]
Why the set of lengths of an optimal code might not unique?
why you don edit your video as quickly?
Could someone please post the formula for the entropy?
How we can compute H2 ?
Shannon entropy. Wikipedia has the equation.
.3 .2 gives .5 u left that addition ,,
sum of p * -logp