Lecture
Polar Coding for Binary Input Channels
Related lectures (31)
Error Correction Codes: Decoding and Communication
Explores error correction codes, decoding algorithms, and their role in communication systems.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Information Theory: Source Coding & Channel Coding
Covers the fundamentals of information theory, focusing on source coding and channel coding.
Quantifier Elimination Steps for Presburger Arithmetic
Explores quantifier elimination steps for Presburger Arithmetic, emphasizing techniques to simplify and eliminate quantifiers efficiently.
Computational Complexity
Covers the basics of computational complexity, including big O notation and complexity classes.
Complexity Classes: P and NPMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
Belief propagation simplification
Explores simplifying belief propagation equations for pairwise models, reducing computational complexity from order n cubed to order n.
Algorithmes: introductionMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Covers the basics of algorithms, problem-solving, and efficient resolution methods.
Binary Coding: Channel Decoding
Explores binary channel decoding and vector spaces in coding theory.
Dynamic Programming: Knapsack
Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.