Polar Codes over q-ary Alphabets and Polynomially Fast Convergence to Shannon Capacity

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=PsD-1bHeui0


Duration: 33:58
1,636 views
16

Ameya Velingker, Carnegie Mellon University
Coding: From Practice to Theory
http://simons.berkeley.edu/talks/ameya-velingker-2015-02-12



Other Videos By Simons Institute for the Theory of Computing


2015-03-25Strong Data Processing Inequalities: Applications to MCMC and Graphical Models
2015-03-25On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
2015-03-25Fast Approximations of the Pattern Maximum Likelihood Estimate
2015-03-25Testing Probability Distributions using Conditional Samples
2015-03-25Detection and Estimation through an Information Theory Lens
2015-03-25Lucky Talk: From Coding to Clustering
2015-03-25Testing Distribution Families
2015-03-25Robust Inference and Local Algorithms
2015-03-18Deciphering the Good-Turing Enigma: Estimating Probabilities of Unlikely and Unseen Events
2015-02-24Symmetric Product Codes
2015-02-19Polar Codes over q-ary Alphabets and Polynomially Fast Convergence to Shannon Capacity
2015-02-19Multi-version Coding and Shared Memory Emulation
2015-02-19Locally Recoverable Code Constructions and Some Extensions
2015-02-19Coding for DNA-based Storage Systems
2015-02-19Sparse Superposition Codes for the AWGN Channel, Message Passing, Replica and Spatial Coupling
2015-02-19The Edge Removal Problem
2015-02-19Are Polar Codes Practical?
2015-02-19Gap to Capacity of Finite Length Polar Codes
2015-02-19A Theory of Polarization
2015-02-19List Recovery and Local Decoding of Expander Codes
2015-02-19Statistical Estimation on Graphs


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Ameya Velingker