Arman Fazeli

Orcid: 0000-0001-8321-3391

According to our database1, Arman Fazeli authored at least 31 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Deterministic Algorithm for Computing the Weight Distribution of Polar Code.
IEEE Trans. Inf. Theory, May, 2024

2022
Transitioning to 6G Part 1: Radio Technologies.
IEEE Wirel. Commun., 2022

Parallelism Versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.
IEEE Trans. Wirel. Commun., 2022

Polar Codes for the Deletion Channel: Weak and Strong Polarization.
IEEE Trans. Inf. Theory, 2022

2021
Polar Coding for Channels With Deletions.
IEEE Trans. Inf. Theory, 2021

Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels.
IEEE Trans. Inf. Theory, 2021

List Decoding of Arıkan's PAC Codes.
Entropy, 2021

Channel Combining for Nonstationary Polarization on Erasure Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes.
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?
Proceedings of the IEEE International Symposium on Information Theory, 2021

Optimal Placement of Read Thresholds for Coded NAND Flash Memory.
Proceedings of the ICC 2021, 2021

Polar List Decoding for Large Polarization Kernels.
Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

2020
Hardness of Successive-Cancellation Decoding of Linear Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Explicit Polar Codes with Small Scaling Exponent.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Convolutional Decoding of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

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

Polar Coding for Deletion Channels: Theory and Implementation.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Minimum Storage Regenerating Codes for All Parameters.
IEEE Trans. Inf. Theory, 2017

Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity.
CoRR, 2017

On Efficient Decoding of Polar Codes with Large Kernels.
Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops, 2017

Permuted successive cancellation decoding for polar codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Viterbi-Aided Successive-Cancellation Decoding of Polar Codes.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Polar codes for channels with deletions.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2015
Generalized Sphere Packing Bound.
IEEE Trans. Inf. Theory, 2015

PIR with Low Storage Overhead: Coding instead of Replication.
CoRR, 2015

Codes for distributed PIR with low storage overhead.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Nontrivial t-designs over finite fields exist for all t.
J. Comb. Theory A, 2014

Generalized sphere packing bound: Applications.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Basic principles.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the scaling exponent of binary polarization kernels.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Degrees of freedom in a three-user cognitive interference channel.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013


  Loading...