Arman Fazeli

IEEE Trans. Inf. Theory, 2021

Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

List Decoding of Arıkan's PAC Codes.

[BibT_eX]

[DOI]

Entropy, 2021

Channel Combining for Nonstationary Polarization on Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Optimal Placement of Read Thresholds for Coded NAND Flash Memory.

[BibT_eX]

[DOI]

Yishen Yeh

Paul H. Siegel

Proceedings of the ICC 2021, 2021

Polar List Decoding for Large Polarization Kernels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

2020

Hardness of Successive-Cancellation Decoding of Linear Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Explicit Polar Codes with Small Scaling Exponent.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Convolutional Decoding of Polar Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

New Frontiers in Polar Coding: Large Kernels, Convolutional Decoding, and Deletion Channels.

[BibT_eX]

[DOI]

Arman Fazeli Chaghooshi

PhD thesis, 2018

Polar Coding for Deletion Channels: Theory and Implementation.

[BibT_eX]

[DOI]

Kuangda Tian

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Minimum Storage Regenerating Codes for All Parameters.

[BibT_eX]

[DOI]

Sreechakra Goparaju

IEEE Trans. Inf. Theory, 2017

Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity.

[BibT_eX]

[DOI]

CoRR, 2017

On Efficient Decoding of Polar Codes with Large Kernels.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops, 2017

Permuted successive cancellation decoding for polar codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Viterbi-Aided Successive-Cancellation Decoding of Polar Codes.

[BibT_eX]

[DOI]

Kuangda Tian

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Polar codes for channels with deletions.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2015

Generalized Sphere Packing Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

PIR with Low Storage Overhead: Coding instead of Replication.

[BibT_eX]

[DOI]

CoRR, 2015

Codes for distributed PIR with low storage overhead.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Generalized sphere packing bound: Applications.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Basic principles.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the scaling exponent of binary polarization kernels.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Nontrivial t-designs over finite fields exist for all t.

[BibT_eX]

[DOI]

Shachar Lovett