Відео

Very nicely explained

He's like average sarkari karamchari

19:22 are bhai arrow kr leta hme kese pta ki this se this ho rha hai.... pura din karab kr iss week ne

mt pda es se bdiya to

great lecture, thanks you .

What will move here and there , the pointer is not even visible really annoying. Try to focus there as well also teach like this in classrooms also

13:40, bit metric need to be M[r_l^(i) given x_l^(i)]

Joydeep

at 9:09, sum_i [lambda_i * (x_i dot g_i)] need to be sum_i [lambda_i * (x dot g_i)]

It tells me why even parity check bit is added leftside of the codewords

dude, you're a perfect teacher... just control your level of voice for God's sake if you see this comment... probably you did so far it's been 6 years.... Thanks anyways

Nice Sir

this is most needed.... there should be at least 2 -4 problem solving sessions after each week

Reed Muller majority decision fails when equal 1's and 0' appear. What to do then?

Reed Muller majority decision fails when equal 1's and 0' appear. What to do then?

The intro is soo asthetic

Excellent video…..

Unbeatable

Why does he only decode 3 bits? The trellis has 4 stages. He should have decoded 4 bits right?

I can also read the slides. Can i be a professor in IIT?

👍

Great lecture!

Thank you for the video sir. Can you please explain the computation part of qi

Iam a 2017 ECE graduate can I know what this topic is about is this course for ppl applying for jobs or for students

Thank you!

Very good lecture, thank you

great lecture!!

Thank you sir, it was very helpful for my seminar on this topic.

I do not understand here about the column permutation which has been done. Could anyone help me to explain please?

Hatsoff sir u are my inspiration 🙏🙏🙏

Great video, thank you! Do we have to take into consideration the unit matrix that will be existing in the actual code as well?

Sphere covering bound is left , I think

thank you very much for the nice presentation. stay bless

Stammering a lot

Stages in error correction?

Thank you very much for the great lecture!

Prof. Banerjee, all your lections are great, thank you very much for giving to us all those great explanations!

Thanks

Would be Better if the professor pitch is a little low

great teaching Sir very nicely explained. Helped me a lot. Thankyou

"constraints": say it LOUDLY, pal. If you swallow the word, everyone is left guessing!

Sir, thanks a lot. It really helped me. 😊

Terrible lecture. The parts that need explaining are explained too little, the parts that don't need explaining (e.g. how to count the columns of a matrix on paper) take up most of the time...

very insightful explanation. This helped me a lot. thanks Sir!

Can we do coding theory here after 12 th

Good morning sir

hello all, Can you please if anyone know about equalizer and wireless communication help me to solve this question Consider an 8-tap FIR equalizer. (a) When the channel coefficients are [1, 0.8] (delays separated by a symbol period), determine the optimum equalizer weight vector. You can either derive it from the z-transform or from the MMSE approach. (b) Plot the real part of the weight vector and comment on its shape and how it is related to the channel coefficients Thank you very much and I appreciate your help

Thank you Sir, Great VIdeo!

very handsome

Bhai qa ant.shant padata h