LEMPEL-ZIV ALGORITHM

[@altunbikubra]

Finally one clear explanation in English, thanks !

[@bikeshshrestha9550]

Though your English in unclear you explanation is clear as water. Hats off bro. Kudos

[@patelvaidik7004]

This explanation is very good and I clear Lempel-Ziv coding. Thanks sir.

[@vagelosb7588]

at last found it . good english .good explanation . nice shirt . thank you

[@LalitVashishtha]

Thanks

[@kasunwijesundara336]

Great Teacher. ! clear and calm while teaching complex theories

[@c00702866]

That's my first time to review your teaching! Very thanks with you and proud for the indians, yours electronic education is the best! I am come from HK!

[@blvckstar777]

thank you sir! that helped me a lot in my finals!

[@ashsingh1234]

Thank You For making it easy a day before exam sir!!

[@ameyanjarlekar9568]

You teach better than my IIT professor

[@quicktwentyminutes]

We can learn anywhere but exposure we get iit is incredible so do not compare Btw i am iitian

[@sandy245]

Easy to understand when u explain Can u also explain Deflate and PNG compression techniques

[@rahulpawar6691]

Sir yours lectures are good and understand able for students Thank you for it #keep supporting

[@MasayoMusic]

Isn't the result of the algorithm much larger than the original string? How does it work for compression? Thank you!

[@pedroteixeira5185]

this only look larger because you are compressin a message of 0's and 1's imagine your A was the zero and the B was the 1 if you use this methode on this example you only need 4 bit to code the leter A, and you would need 5 bits for example to code it (25 leters or something>16)

[@pedroteixeira5185]

the sequence ABAB would require 4 bits instead of 5*4 bits that would require without compression i was having the same question, it looks like it doesnt compress but it actually does

[@arman6766]

When you don't have a very long sequence like in this case, there is no redundancy so the compression actually produces even longer sequences. Imagine a data stream of thousands of KB's, you would have a lot more redundancy and this algorithm is gonna take out that redundancy to produce compressed streams.

[@Oldpapers-f3v]

How data compressed here ? Encoded bits are more than original bits why?

[@prabhas1776]

Great professor. Good explanation ♥️

[@thanghong4482]

thank you teacher Thanks to you, I understood this part that I didn't listen to in class

[@solare--04]

thanh you for making it easy a day before exam sir!!!

[@roykibet6038]

Best video on LZW so far,,

[@vanesamorales6991]

Thanks from Ecuador !!! :)

[@JakeBayne624]

Neat and clean explanation.

[@rohanvarmarudraraju3343]

Thank you sir , loved the expression at 4:56

[@DarkKnight7_1]

Clear and Perfect Presentation !

[@cyliamokrani2928]

thank you so much sir, a clear explanation

[@evilpollination1916]

Great explanation sir

[@ahmadkurd2474]

Thanks for your support

[@princeyawgharbin1955]

This really has saved me , I got exam tomorrow...Thanks Sir

[@siddheshmahajan50]

Lalit ji, tum bahut mast kaam karta hai...

[@sarthakyende.2076]

Bappu tu pass hoagaya ... baghwan tumhe salamat rakhe

[@Abhishek-iq9lo]

Nice Explanation!

[@souravdev8543]

thanku so much sir...how easily u explain this..

[@JitendraKumwatPIETCS]

thank you sir for your way to explain this theorem

[@yogeshvidolkar3025]

I was trying to understand this topic for about half an hour, but I could not understand anything, all understood from this video within 8 minutes..Thank you so much...

[@rajeshvashishtha7431]

Well said..

[@lemagneto2546]

Best explanation thankyou so much sir

[@ilyaantipyev8034]

its nice. but show the full board at least for 3 seconds please

[@GeorgeTsiros]

what happens if the data does not end at ...1010 but instead ends ...101 ? "101" has been seen before, but there are no more symbols left... i suspect we can add extra padding bit (or more) so that we create a new symbol?

[@LalitVashishtha]

No, no padding is done in this situation. We have to write the codeword of 101 which has already been found.

[@GeorgeTsiros]

@@LalitVashishtha so during the first phase, we read 101 at the end and since this sequence was seen before, we ignore it? This makes more sense, also thank you SO MUCH for answering!

[@debashritapanicker7644]

Amazing explanation sir! thank you so much.

[@mayankgijre]

Aren't You Supposed to Assume that 0,1 are already stored in the Dictionary 🤔

[@cybercub4367]

same doubt

[@navdeepkhurmi7788]

Howw u find dictionary locationn iss ir already given orr that we have to findd first??? I not getting thiss could anyone please clear this out

[@LalitVashishtha]

Memory location always starts with 1 and increases 1 in next step and so on...

[@NgoVanDung-BDCVT]

Thankyou very helpful

[@manjusharma2712]

Beautiful explanation...

[@blazingsniper1239]

the lsb name is innovation symbol

[@ni788n6]

Your awesome sir

[@saurabhbangale7181]

Bahot sahi explanation Sir...!!👍

[@amelbenzaid7440]

Thank you sir what about a matlab function (used to calcule lempel-Ziv parmetere EEG )?

[@souvikkar7963]

Sir you explained only the encoding part. Do explain the decoding of the same. The rest was simple to understand and very helpful.

[@LalitVashishtha]

I will try to upload decoding video by this week

[@LalitVashishtha]

I will try to upload it by today itself

[@abhinavmishra3734]

Perfect explanation

[@LalitVashishtha]

thanks

[@Nitzzzzz24]

thankyou🙇‍♂

[@chinmaydwivedi549]

Best Teacher!!!

[@abhishekKumar_sheki]

Thnx I got 5 marks question from this topic in my end exam.

[@nishapal6805]

Flawlessly explained

[@Jaya.M78]

Thank you so much sir

[@InspiireVibes]

thx, my english is bad but i could understand you

[@luanpd8397]

many thanks, sir !

[@anarkaliprabhakar6640]

Nice

[@priyalakshmiprasad9726]

Great video sir!

[@rahulmavoori3106]

Can u explain wht is dictionary locatiom

[@TheCoxinator747]

Excellent!

[@abdelbakimohammed4677]

Bonjour, Je veux savoir ça si possible, 3- La compression doit normalement générer un mot de code de taille réduite. expliquez moi, pourquoi l'algorithme de Lempel-Ziv n'a pas pu réduire la longueur du message de source dans l'exemple: AABABBBABAABABBBABBABB 4- Aidez moi par un autre exemple dont la compression effectuée permet de réduire la taille du message de source.

[@saikatbiswas3549]

Sir, you are just awesome.

[@8888rian]

Thank you so much, very helpful.

[@NavjotSingh-vd1me]

i m confused how to get RLE for 101010 could u solve

[@naoromunda2731]

What do you mean by RLE here?

[@NavjotSingh-vd1me]

@@naoromunda2731 run length encoding

[@naoromunda2731]

(11,10)

[@naoromunda2731]

Since 10 is repeated 3 times

[@sushantgupta4757]

thanku so much sir

[@TheFreestylelogic]

Very nice sir

[@adalynrutherford6116]

Good example

[@taruneeshsachdeva1615]

beautiful explanation

[@deepak11]

Sir i could bot understood dictionary location Remains is excellent

[@LalitVashishtha]

Dictionary location always starts with 1 upto the number of codewords. LZ algo is fixed length encoding scheme. Thesefore, number of zeroes are appended in LHS in dictionary locatilon. It depends on the base of the number system. For binary numbers willbe 0 and 1 only, in ternary numbers will be 0, 1, 2; in quaternary numbers will be 0, 1, 3, 4 and so on.

[@LalitVashishtha]

in above comment make on correction for quaternary daya numbers will be 0,1,2 and 3

[@riteshpatil5265]

How to write dictionary location ?tell me sir

[@LalitVashishtha]

Location always starts with 1. Here info sequence is in binary and there is 8 info seq. We need dictionary location of prefix, so we need 1 to 7 locations.Since LZ algo is fixed length encoding and If we take location of 8th info seq it will take bits that is 1000 and this location will never be used. So we shall take locations from 1 to 7. 7 is the largest no here which will be written as 111 in binary therefore 1 will be written as 001. 2 as 010. 3 as 011 and so on.

[@LalitVashishtha]

Dictionary log starts with 1 to no of info seq. Since it is fixed length encoding technique all the locations will har same number of digits. Here 1 is written as 001, 2 as 010, 3 as 011, 4 as woo Tec.

[@tanphatpham9190]

thank you !

[@manjuladevi9628]

Thank u sir

[@munakumarjani122]

Thank uh so much Sir

[@heisenbergwhite9310]

Thanks

[@babydevil1485]

Arigato gozaimasu !!!!!!

[@krao2831]

Effort👍👏

[@dharshiniselvam6100]

Tq so much sir

[@ramireddypoli8873]

Thank You Sir

[@binduagarwalla670]

good one

[@asitamannadas88]

Cannot solve AAABBCCDDABBA using lzw

[@RohitKumar-jz5cu]

tommorrow is our semester exams & your videos are really helpful. Thanks a lot lalit sir

[@yusuffaesal9523]

Thanks slot

[@swathibalagari4205]

Tq

[@nandinikose1414]

0 00101110010100101 iska phase batao 8 sequence ayenge Kya? Or 9

[@LalitVashishtha]

0, 00, 1, 01, 11, 001, 010, 0101

[@nandinikose1414]

Sry but.... Humare clg k sir ne 9 sequences likh KR diye!!!!. Like: 0 1 00 01 011 10 010 100 101

[@LalitVashishtha]

He will be using something else, you may go throgh Information Theory< Coding and Cryptography by Prof Ranjan Bose IIT Delhi

[@sribolla3098]

tq

[@neemabisht1727]

Tqq sir

[@lifeinjesus3357]

.thank you.Sir can you please tell me tge text book for reference

[@LalitVashishtha]

Information theory, coding and cryptography by Ranjan Bose TMH publication

[@naziajahan1657]

your explanation is wrong, you are saying you see 8 codewords so there will be 3 bit dictionary location. for 010100110110, I divide, 0,1,01,00,11,011,0 and then according toyour explanation I will need 3 bit location entries, since i have 7 types of symbols to code. but for the above mentioned problem i will need actually 2 bit dictionary location.very misleading explanation

[@LalitVashishtha]

I don't know which book you are following, but if you go through "Information Theory, Coding and Cryptography" by Prof. Ranjan Bose, IIT Delhi; you will get the same concept as I discussed here.

[@LalitVashishtha]

link me your concept or explain it if possible.

[@naziajahan1657]

@@LalitVashishtha 0,1,01,00,11,011,0 can be encoded as 00(0), 00(1), 01(1), 01(0), 10(1), 11(1), 01

[@LalitVashishtha]

Put some link or name of the book you are following

[@kushal7406]

You are not solving any doubts of any student so why you telling us to write...

[@Memeumator]

we won cricket match, muhahaha

[@stalvinmenezes]

thankyou sir