Error Correction for 5G Communication (LDPC codes)

Discover how hamming & LDPC codes allow 5G communication networks to recover from errors and lost data using randomly-assigned parity check sets - see how messages can magically fix themselves.

🕒 Topics Covered:
[00:00] The Problem: Data Corruption & Errors
[01:15] Repetition Codes: The Simple Solution
[02:45] Single Parity Check: A Smarter Approach
[04:10] Hamming's Breakthrough: Overlapping Sets
[06:30] The Challenge with Long Messages
[08:15] Gallagher's LDPC Innovation
[10:45] How Modern LDPC Codes Work
[12:30] From Theory to Practice: Why Timing Matters
Perfect for students, engineers, or anyone curious about how their messages get through reliably despite noise and interference in the communication channel. Learn why these brilliant solutions weren't practical until decades after their invention, and how they enable the lightning-fast communications we rely on today.

[SANDEEPKUMARBAIRWA-uj]

I will Rate this video #1 in teaching concepts. There should be a youtube AWARDS yearly for best video in teaching, reporting, .... all genre !!! I am sure this video will find an award there.

[danielwarnock]

This is an exceptional video, I searched "error correcting code" and the first 10 results were ads and idiotic nonsense. I'm very happy to have found this.

[tommasog]

brother this video is so good it makes me emotional, like it makes me regain faith in humanity.

[goosew]

As someone who has done a mathematics and computer science degree, these videos are PERFECT to watch during lunch break at work. Thanks!

[_._enril_._]

Such a great, high quality video. Thank you

[TypicalRararian]

Wow, what a great explanation! I have professors who try to explain this lecture after lecture using cluttered equations that hide the essence of the idea. Maths is important, but it is useless without a context or an understand of the idea. Sometimes I wonder if they do this deliberately, to make us think that they are really clever for understanding such a long string of equations.

[hymao]

Probably a stupid question, but how does the receiving computer know which bit is tied to which parity bit if they are random?

[LnX]

that was a brilliant explanation, the reasoning of the naming and how you connected that part was perfect, thank you

[EvanMildenberger]

I keep realizing information theory and coding theory are much more fundamental to computation and communications than Turing machines and programming languages, which is what I focused on while studying computer science. I think we get overly focused on the imperative perspective of processing and storing/sending data because Turing and Von Neuman's work became more popular than Church, Schönfinkel, Backus's perspectives, which is more focused on describing states (algebraic data types) and their dependance (currying) than how to operate on the bits in time. I think this descriptive "tell me what" over imperative "tell me how" is more inline with ideas of Shannon and Hamming regarding information (related to the cardinality of the set of whatever has the information) and encoding/decoding that information with another set that preserves / approximates that information content (coding maps between sets).

[NeilRieck]

This video made me recall an ECC lecture at DEC (Digital Equipment Corp) during a maintenance course on the PDP-11/44. Prior to that, tape decks only had vertical parity (the ninth bit of every byte) and longitudinal parity which was a byte appended to the end of each block of 512 or 1024 bytes. With this scheme, vertical and longitudinal errors would point directly to a single correctable error. Things improved when the longitudinal byte was replaced with a 16-bit ECC implemented as 2-bytes (many implementations were based upon CRC-11). Getting back to the PDP-11/44, every 32-bits of data were implemented with 39-bits of memory (every 8-bit byte had a parity bit; 3 additional bits were necessary to implement the hamming code). With this scheme all single-bit errors were correctable as well as many double-bit errors)

[falpato]

You are truly gifted in explaining complicated things in a simple and interesting way and I just want to thank you for sharing your knowledge in an entertaining manner. Your effort in making those educational videos in your channel is highly appreciated and I'm looking forward for more videos to watch. I just wish you could write a technical ebook about the contents of your channel since I really love your elegant style of teaching of getting to the bare essentials of a certain concept. Cheers and more power to your channel!

[raresmircea]

Quality wise i think AotP makes it easily in the top 10 educational channels. Every single upload is elegant, entertaining and informative.. I miss those explanations done with strings and peas and bowls though :)

[CrucialMuzic]

You know it's going to be a great day when *Art of the Problem* uploads a new video!
Happy Thanksgiving, everyone!

[filimonmiki]

Thanks for making this video! You made complicated and theoretical concepts easy to grasp.

[mizumizumizu]

Highly informative, yet very easy to understand. Thank you for this video! The visual elements really help linking the examples to the theoretical notions behind them.

[alderiatefanclub]

Thank you so much for this video, I had trouble understanding LDPC codes but now it's crystal clear.

[nbme-answers]

Brit, as a non–computer scientist with aspirations to better become one, you continually blow my mind with these videos. Remarkable tutes. So clear. Great examples & animations. Zero pretension. I hope Khan Academy is still featuring all your stuff. Will contribute to your Patreon soon.

[jean-marclugrin]

Finally I understood the essence of LDPC codes. Thanks

[rastislavledaj]

Big thumb up! Very nice and logical explanation of LDPC. 👍

[andreastedile]

I subscribed back when you made the RSA video, superb channel 💪🏻