Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Arikan Meets Shannon - Polar Codes With Near-Optimal Convergence to Channel Capacity

Association for Computing Machinery (ACM) via YouTube

Overview

Explore the groundbreaking concept of polar codes and their near-optimal convergence to channel capacity in this 26-minute conference talk. Delve into binary-input discrete symmetric memoryless channels, channel coding with linear codes, and Shannon capacity. Examine entropy polarization, recursive applications, and scaling exponents for polar codes. Investigate strong local polarization for BEC and BMS channels, focusing on single kernel analysis. Conclude with insights into bit-decoding of random linear codes, gaining a comprehensive understanding of this innovative approach to information theory and coding.

Syllabus

Intro
Binary-input Discrete Symmetric Memoryless Channel
Examples of BMS channels
Channel coding with linear codes
Shannon capacity
Channel entropy & capacity
Entropy Polarization
Recursive application
Scaling exponents for polar codes
Strong local polarization for BEC
Strong local polarization for BMS channel
3: single kernel
Bit-decoding of random linear codes

Taught by

Association for Computing Machinery (ACM)

Reviews

Start your review of Arikan Meets Shannon - Polar Codes With Near-Optimal Convergence to Channel Capacity

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.