So first of all this is a great question so as we proceed as per algorithm then - 1) In {0,10,011,111} we see that 0 is prefix of 011 so now the set becomes {0,10,011,111,11} 2) From this stage I see that 11 is prefix of 111 so next set becomes {0,10,011,111,11,1} 3) Now if we see carefully then 1 is prefix of 10,111,11 and the dangling suffixes(0,11,1) obtained are not unique anymore in the set. So as per this I am saying that it is not UDC.
@Hritik Singh Your explanation is correct, it's not UDC. Let's see by taking an example - Suppose the sequence is 01110. It can be decoded in two ways - 1) 0,111, 0 2) 011, 10 I am happy to see that everyone is helping each other. Thanks.
Not UDC because if we compare 1 and 110 the prefix is 1 and dangling suffix is 10 and it is already present in the codeword that's why the code is not UDC
![ILLSLICK - THE KING'S LANDING [Freestyle]](http://i.ytimg.com/vi/feIJJnNkTfk/mqdefault.jpg)
I took my data compression exam today. Your lectures were a great help. Thank you so much.
The Most beautiful Explain I have ever seen.Thank you so much
Great job Rudra. Your videos are short, crisp and clear. Keep up the great work, you'll surely be an awesome teacher if you wish to!
Brother I don't know your all videos sufficient or not for my upcomming exams but bro your explanation is just next level : ) Thanks, Bro!!
Great explanation broo!!
U saved me.
Thanks man! You saved my exam!
Great explanation ❤
Excellent👏👏. Please!!! upload more videos of data compression
Excellent.... Thank you so much my friend 👏👏👌👌
excellent explanation bhaiya jii
Bro, you are a life saver.🔥
wonderful explanation sir. keep it up 👏👏👌👌
Only playlist on TH-cam for Data Compression.
you are fantastic, god bless you
Nice 👍👏😊
Very well explained good work bro🔥
thanks a lot really helpful.
Thanks bro. Good job
can we combine a1 and a1 or a4 and a4 or is that not permitted?
Very Good Explain.
Great explanation! But an you please tell is { 0 ,10 ,011 ,111 } UDC?
So first of all this is a great question so as we proceed as per algorithm then -
1) In {0,10,011,111} we see that 0 is prefix of 011 so now the set becomes {0,10,011,111,11}
2) From this stage I see that 11 is prefix of 111 so next set becomes {0,10,011,111,11,1}
3) Now if we see carefully then 1 is prefix of 10,111,11 and the dangling suffixes(0,11,1) obtained are not unique anymore in the set.
So as per this I am saying that it is not UDC.
@@V1S1ONPLAYS which book are you talking about N and C?
@Hritik Singh
Your explanation is correct, it's not UDC.
Let's see by taking an example -
Suppose the sequence is 01110.
It can be decoded in two ways -
1) 0,111, 0
2) 011, 10
I am happy to see that everyone is helping each other.
Thanks.
excellent bro keep it up..
well explained thank you so much
Thank you bro 😊 ❤️❤️
Please make some more videos for Data compression subject
very very good explanation, saved my life thanks
You are most welcome.
hi Rudra you can write example to semaphore code? it's subclass of the prefix codes
👍👍👍
Please wait before rubbing the board..... Screenshot bhi lena hota hai
subscribed..
Very helpful. Thanks so much
So nice
Explain markov model as we have paper on day after tomorrow
thank you... great explaination
please tell me (1,01,001,000) is UDC or not
Thank you
this code is UDC 10,00,11,110. But your algo would say it is NOT.
Bhai Adaptive Huffman coding p video banao.
Please make a video Kraft McMillion inquality
thank youuu!!!!!
Thanks for explanation
Please explain discrete time markov chain
Tysm
can any one tell me that {1,10,110,111} is UDC or not?
Udc
@@tejaswidutsharma6819 Thanks
Welcome
Not UDC because if we compare 1 and 110 the prefix is 1 and dangling suffix is 10 and it is already present in the codeword that's why the code is not UDC
But sir book mai udc Diya hai
Thank you brother 😌