Mika Göös, T. S. Jayram, et al.
ACM TOCT
Paper
A note on some inequalities used in channel polarization and polar coding
Abstract
We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel.
Related
Conference paper
Exchangeability and realizability: De finetti theorems on graphs
T. S. Jayram, Jan Vondrák
APPROX/RANDOM 2014
Conference paper
Randomized communication vs. partition number
Mika Göös, T. S. Jayram, et al.
ICALP 2017
Conference paper
Simple analyses of the Sparse Johnson-Lindenstrauss transform
Michael B. Cohen, T. S. Jayram, et al.
SOSA 2018