A note on some inequalities used in channel polarization and polar coding

T. S. Jayram; Erdal Arikan

doi:10.1109/TIT.2017.2717598

IEEE Trans. Inf. Theory

Paper

01 Aug 2018

A note on some inequalities used in channel polarization and polar coding

View publication

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.

Conference paper

On multiplicative weight updates for concave and submodular function maximization [extended abstract]

Chandra Chekuri, T. S. Jayram, et al.

ITCS 2015

Conference paper

Randomized communication vs. partition number

Mika Göös, T. S. Jayram, et al.

ICALP 2017

Conference paper

Exchangeability and realizability: De finetti theorems on graphs

T. S. Jayram, Jan Vondrák

APPROX/RANDOM 2014

Conference paper

Simple analyses of the Sparse Johnson-Lindenstrauss transform

Michael B. Cohen, T. S. Jayram, et al.

SOSA 2018

View all publications

Abstract

Related

On multiplicative weight updates for concave and submodular function maximization [extended abstract]

Randomized communication vs. partition number

Exchangeability and realizability: De finetti theorems on graphs

Simple analyses of the Sparse Johnson-Lindenstrauss transform