Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the topic of error-correcting codes, focusing on Low Density Parity Check codes and their decoding process. The instructor explains the concept of constraints satisfaction and the importance of choosing codes randomly. The lecture also delves into the graphical representation of constraints using Tanner graphs and the process of building configurations to detect mistakes. Additionally, it discusses the significance of repetition codes in error detection and the methods for maximizing decoding probabilities. The lecture concludes with a detailed explanation of how to compensate for errors in the decoding process.