T. S. Jayram, T. Kornuta, et al.
ICMLA 2018
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
Chandra Chekuri, T. S. Jayram, et al.
ITCS 2015
Conference paper
Exchangeability and realizability: De finetti theorems on graphs
T. S. Jayram, Jan Vondrák
APPROX/RANDOM 2014
Conference paper
Resource-efficient common randomness and secret-key schemes
Badih Ghazi, T. S. Jayram
SODA 2018