activity
20022020
most citedChannel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels

4.5k citations · 5.1k across the 14 of their papers we have counts for

collaborators

14 papers

cs.IT2020★ 21 cited

Performance and Complexity of Sequential Decoding of PAC Codes

Mohsen Moradi, Amir Mozammel, Kangjian Qin +1

Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity compariso…

cs.IT2019★ 166 cited

From sequential decoding to channel polarization and back again

Erdal Arıkan

This note is a written and extended version of the Shannon Lecture I gave at 2019 International Symposium on Information Theory. It gives an account of the original ideas that moti…

cs.IT2016

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

T. S. Jayram, Erdal Arikan

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.

cs.IT2015

On the Origin of Polar Coding

Erdal Arıkan

Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in…

cs.IT2015★ 2 cited

A Packing Lemma for Polar Codes

Erdal Arıkan

A packing lemma is proved using a setting where the channel is a binary-input discrete memoryless channel , the code is selected at random subject…

cs.IT2015★ 1 cited

Challenges and some new directions in channel coding

Erdal Arikan, Najeeb ul Hassan, Michael Lentmaier +2

Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, non-bin…