2. Lempel Ziv Coding (Basics, Algorithm, Procedure & Example) Explained in Digital Communication

Not clear

Content is really great and I loved your all videos. Sir plz upload the videos of wireless communications for cse Btech students cuz my examination is going to be started from the end of December.
Thank you so much sir for this amazing content.

i am confused in case of numeric representation, it was done differently in alphabets video.

In the previous video, you had taken single A and B and considered it a segment, but here in this one you are not considering, 0 and 1 a segment. why is that so??

Thank U sir

Thanks for video

This is too helpful, God bless you abundantly.

in case of alphabets, u segmented single char, they y here taking 00 as single segment instead of 0

Clear Explanation. Thank you so much

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.

sir please do a video on dadda multiplier and its verilog code.