Hessam Mahdavifar

Orcid: 0000-0001-9021-1992

According to our database1, Hessam Mahdavifar authored at least 97 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Iterative Sketching for Secure Coded Regression.
IEEE J. Sel. Areas Inf. Theory, 2024

Erratum to "LightVeriFL: A Lightweight and Verifiable Secure Aggregation for Federated Learning".
IEEE J. Sel. Areas Inf. Theory, 2024

LightVeriFL: A Lightweight and Verifiable Secure Aggregation for Federated Learning.
IEEE J. Sel. Areas Inf. Theory, 2024

On Fast SC-based Polar Decoders: Metric Polarization and a Pruning Technique.
CoRR, 2024

Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds.
CoRR, 2024

DREW : Towards Robust Data Provenance by Leveraging Error-Controlled Watermarking.
CoRR, 2024

Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Abelian Group Codes for Classical and CQ Channel Coding: One-Shot and Asymptotic Rate Bounds.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Subspace Coding for Spatial Sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Projective Systematic Authentication via Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Bounds on the Statistical Leakage-Resilience of Shamir's Secret Sharing.
Proceedings of the IEEE International Symposium on Information Theory, 2024

High-Rate Fair-Density Parity-Check Codes.
Proceedings of the IEEE International Conference on Communications, 2024

2023
Capacity-Achieving Polar-Based Codes With Sparsity Constraints on the Generator Matrices.
IEEE Trans. Commun., September, 2023

New Bounds on the Size of Binary Codes With Large Minimum Distance.
IEEE J. Sel. Areas Inf. Theory, 2023

Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes.
IEEE J. Sel. Areas Inf. Theory, 2023

Channel Coding at Low Capacity.
IEEE J. Sel. Areas Inf. Theory, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.
IEEE J. Sel. Areas Inf. Theory, 2023

Analog Multi-Party Computing: Locally Differential Private Protocols for Collaborative Computations.
CoRR, 2023

Optimized Strategies for Big Data Offloading in Vehicular Ad-Hoc Networks.
Proceedings of the 97th IEEE Vehicular Technology Conference, 2023

Non-adaptive Quantitative Group Testing via Plotkin-Type Constructions.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Matrix Completion over Finite Fields: Bounds and Belief Propagation Algorithms.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Differentially Private Coded Computing.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Covert Millimeter-Wave Communication: Design Strategies and Performance Analysis.
IEEE Trans. Wirel. Commun., 2022

Hybrid Non-Binary Repeated Polar Codes.
IEEE Trans. Wirel. Commun., 2022

Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks.
IEEE Trans. Inf. Theory, 2022

Analog Secret Sharing With Applications to Private Distributed Learning.
IEEE Trans. Inf. Forensics Secur., 2022

Polar Coded Repetition.
IEEE Trans. Commun., 2022

ML-Aided Collision Recovery for UHF-RFID Systems.
Proceedings of the IEEE International Conference on RFID, 2022

A New Algebraic Approach for String Reconstruction from Substring Compositions.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Orthonormal Sketches for Secure Coded Regression.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Low-Complexity Decoding of a Class of Reed-Muller Subcodes for Low-Capacity Channels.
Proceedings of the IEEE International Conference on Communications, 2022

ApproxIFER: A Model-Agnostic Approach to Resilient and Robust Prediction Serving Systems.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Distributed Multi-User Secret Sharing.
IEEE Trans. Inf. Theory, 2021

Massive Coded-NOMA for Low-Capacity Channels: A Low-Complexity Recursive Approach.
IEEE Trans. Commun., 2021

Analog Lagrange Coded Computing.
IEEE J. Sel. Areas Inf. Theory, 2021

Coded Computing via Binary Linear Codes: Designs and Performance Limits.
IEEE J. Sel. Areas Inf. Theory, 2021

List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier.
IEEE J. Sel. Areas Inf. Theory, 2021

Threshold-Secure Coding With Shared Key.
IEEE J. Sel. Areas Inf. Theory, 2021

FeO2: Federated Learning with Opt-Out Differential Privacy.
CoRR, 2021

Numerically Stable Binary Coded Computations.
CoRR, 2021

Coded Machine Unlearning.
IEEE Access, 2021

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

Analog Privacy-Preserving Coded Computing.
Proceedings of the IEEE International Symposium on Information Theory, 2021

New Packings in Grassmannian Space.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Reed-Muller Subcodes: Machine Learning-Aided Design of Efficient Soft Recursive Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Hybrid Non-Binary Repeated Polar Codes For Low-SNR Regime.
Proceedings of the IEEE International Symposium on Information Theory, 2021

KO codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learning.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Uplink Non-Orthogonal Multiple Access Over Mixed RF-FSO Systems.
IEEE Trans. Wirel. Commun., 2020

Polar Coding for Non-Stationary Channels.
IEEE Trans. Inf. Theory, 2020

Physical Layer Secret Key Generation in Static Environments.
IEEE Trans. Inf. Forensics Secur., 2020

Capacity-achieving Polar-based LDGM Codes.
CoRR, 2020

Privacy-Preserving Distributed Learning in the Analog Domain.
CoRR, 2020

Polar Coded Repetition for Low-Capacity Channels.
Proceedings of the IEEE Information Theory Workshop, 2020

Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Numerically Stable Binary Gradient Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Cell Association via Boundary Detection: A Scalable Approach Based on Data-Driven Random Features.
Proceedings of the 54th Asilomar Conference on Signals, Systems, and Computers, 2020

2019
Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes.
IEEE Trans. Inf. Theory, 2019

Coding for Crowdsourced Classification with XOR Queries.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Coded Distributed Computing: Performance Limits and Code Designs.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Secret Key Generation via Pulse-Coupled Synchronization.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Covert Millimeter-Wave Communication via a Dual-Beam Transmitter.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018
Global Games With Noisy Information Sharing.
IEEE Trans. Signal Inf. Process. over Networks, 2018

A Low-Complexity Recursive Approach Toward Code-Domain NOMA for Massive Communications.
Proceedings of the IEEE Global Communications Conference, 2018

Outage Probability Analysis of Uplink NOMA Over Ultra-High-Speed FSO-Backhauled Systems.
Proceedings of the IEEE Globecom Workshops, 2018

A Novel Approach to Secure Communication in Physical Layer via Coupled Dynamical Systems.
Proceedings of the IEEE Global Communications Conference, 2018

Fast Secret Key Generation in Static Environments Using Induced Randomness.
Proceedings of the IEEE Global Communications Conference, 2018

2017
Relaxed Polar Codes.
IEEE Trans. Inf. Theory, 2017

Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A new approach for constructing and decoding maximum rank distance codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Fast polarization for non-stationary channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Scaling exponent of sparse random linear codes over binary erasure channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Polar Coding for Bit-Interleaved Coded Modulation.
IEEE Trans. Veh. Technol., 2016

Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding.
IEEE Trans. Commun., 2016

Fast Polarization and Finite-Length Scaling for Non-Stationary Channels.
CoRR, 2016

2015
Rate-Compatible Polar Codes for Wireless Channels.
CoRR, 2015

Relaxed channel polarization for reduced complexity polar coding.
Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015

Coding for tag collision recovery.
Proceedings of the 2015 IEEE International Conference on RFID, 2015

Explicit capacity achieving codes for defective memories.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Diffusion channel with Poisson reception process: capacity results and applications.
Proceedings of the IEEE International Symposium on Information Theory, 2015

HARQ Rate-Compatible Polar Codes for Wireless Channels.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

Threshold policy for global games with noisy information sharing.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014
Rewriting Codes for Flash Memories.
IEEE Trans. Inf. Theory, 2014

Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes.
IEEE Trans. Commun., 2014

Fast multi-dimensional polar encoding and decoding.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Techniques for polar coding over multiple access channels.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013
Algebraic List-Decoding of Subspace Codes.
IEEE Trans. Inf. Theory, 2013

Achieving the Uniform Rate Region of Multiple Access Channels Using Polar Codes.
CoRR, 2013

Compound polar codes.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

On the construction and decoding of concatenated polar codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
List decoding of subspace codes and rank-metric codes.
PhD thesis, 2012

List-decoding of subspace codes and rank-metric codes up to Singleton bound.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes.
IEEE Trans. Inf. Theory, 2011

Algebraic list-decoding of subspace codes with multiplicities.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Algebraic list-decoding on the operator channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
A nearly optimal construction of flash codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Optimal interleaving algorithms for generalized concatenated codes.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009


  Loading...