374 citations · 818 across the 73 of their papers we have counts for
84 papers
The Most Informative Bit and Beyond: A Proof of the Courtade--Kumar Conjecture and Multibit Extensions
Hessam Mahdavifar, Ahmad Beirami
Let \(X=(X_1,\ldots,X_n)\) be uniform on the Boolean cube, and let \(Y\) be obtained by passing its coordinates independently through a binary symmetric channel with crossover prob…
Quantum LDPC and High-Rate CSS Codes from Fair-Density Parity-Check Codes
Hessam Mahdavifar
We construct quantum LDPC (qLDPC) and high-rate CSS codes from our recently introduced classical fair-density parity-check (FDPC) codes. To this end, we introduce a structured spar…
Multi-Tag Collision Recovery in UHF-RFID Using Self-Attention Decoding
Talha Akyildiz, Siva Aditya Gooty, Hessam Mahdavifar +1
Passive ultra high frequency (UHF) radio frequency identification (RFID) enables battery-free tags to communicate with a reader through backscatter. When multiple tags respond in t…
Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
Sheida Rabeti, Hessam Mahdavifar
We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This…
Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes
Sheida Rabeti, Hessam Mahdavifar
In this paper, we propose a belief-propagation (BP)-based decoder, termed the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for quantum low-density parity-check (QLDPC)…
Cost-Aware Neural Early Stopping for Local Constraint OSD Decoders
Talha Akyildiz, Hessam Mahdavifar
Local constraint ordered statistics decoding (LC-OSD) provides strong soft decision performance for short block length linear codes, but its practical cost is dominated by the numb…
Multibeam Phased Arrays with Spherical Gold Spatio-temporal Coding for Fading-Resilient and Delay Robust Beam Isolations
Yuan Ma, Mike Ballou, Kyle Richard +2
Future integrated sensing and communication (ISAC) systems require simultaneous multibeam operation with low-latency hardware and robust isolation under synchronization error and f…
Covering in Hamming and Grassmann Spaces: New Bounds and Reed--Solomon-Based Constructions
Samin Riasat, Hessam Mahdavifar
We study covering problems in Hamming and Grassmann spaces through a unified coding-theoretic and information-theoretic framework. Viewing covering as a form of quantization in gen…
Deep Reinforcement Learning-Aided Strategies for Big Data Offloading in Vehicular Networks
Talha Akyildiz, Hessam Mahdavifar
We consider vehicular networking scenarios where existing vehicle-to-vehicle (V2V) links can be leveraged for an effective uploading of large-size data to the network. In particula…
Deep Learning-Enabled Multi-Tag Detection in Ambient Backscatter Communications
Talha Akyildiz, Hessam Mahdavifar
Ambient backscatter communication (AmBC) enables battery-free connectivity by letting passive tags modulate existing RF signals, but reliable detection of multiple tags is challeng…
Efficient Decoders for Sensing Subspace Code
Siva Aditya Gooty, Hessam Mahdavifar
Sparse antenna array sensing of source/target via direction of arrival (DoA) estimation motivates design of the sensing framework in joint communication and sensing (JCAS) systems…
List Decoding and New Bicycle Code Constructions for Quantum LDPC Codes
Sheida Rabeti, Hessam Mahdavifar
In this paper, we propose a new decoder, called the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for Quantum Low-Density Parity-Check (QLDPC) codes. It extends the Mul…
Layered Normalized Min-Sum Decoding with Bit Flipping for FDPC Codes
Niloufar Hosseinzadeh, Mohsen Moradi, Hessam Mahdavifar
Fair-density parity-check (FDPC) codes have been recently introduced demonstrating improved performance compared to low-density parity-check (LDPC) codes standardized in 5G systems…
Efficient Low-Memory Fast Stack Decoding with Variance Polarization for PAC Codes
Mohsen Moradi, Hessam Mahdavifar
Polarization-adjusted convolutional (PAC) codes have recently emerged as a promising class of error-correcting codes, achieving near-capacity performance particularly in the short…
A Locally Differential Private Coding-Assisted Succinct Histogram Protocol
Hsuan-Po Liu, Hessam Mahdavifar
A succinct histogram captures frequent items and their frequencies across clients and has become increasingly important for large-scale, privacy-sensitive machine learning applicat…
On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization
Mohsen Moradi, Sheida Rabeti, Hessam Mahdavifar
Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Ch…
Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs
Sheida Rabeti, Mohsen Moradi, Hessam Mahdavifar
In this paper, we explore the design and analysis of regular bipartite graphs motivated by their application in low-density parity-check (LDPC) codes specifically with constrained…
Efficient Covering Using Reed--Solomon Codes
Samin Riasat, Hessam Mahdavifar
We propose an efficient algorithm to find a Reed-Solomon (RS) codeword at a distance within the covering radius of the code from any point in its ambient Hamming space. To the best…
Precoding Design for Limited-Feedback MIMO Systems via Character-Polynomial Codes
Siva Aditya Gooty, Samin Riasat, Hessam Mahdavifar +1
This paper presents a precoding codebook design for limited-feedback multiple-input multiple-output (MIMO) systems under the equal-gain transmission (EGT) constraint. In particular…
PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
Mohsen Moradi, Hessam Mahdavifar
Recently, a novel variation of polar codes known as polarization-adjusted convolutional (PAC) codes has been introduced by Arıkan. These codes significantly outperform conventional…
A New Metric Function for SC-based Polar Decoders: Polarization, Pruning, and Fast Decoders
Mohsen Moradi, Hessam Mahdavifar
In this paper, we propose a method to obtain the optimal metric function at each depth of the polarization tree through a process we call polarization of the metric function. This…
Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes
Samin Riasat, Hessam Mahdavifar
We propose efficient minimum-distance decoding and list-decoding algorithms for a certain class of analog subspace codes, referred to as character-polynomial (CP) codes, recently i…
Subspace Coding for Spatial Sensing
Hessam Mahdavifar, Robin Rajamäki, Piya Pal
A subspace code is defined as a collection of subspaces of an ambient vector space, where each information-encoding codeword is a subspace. This paper studies a class of spatial se…
Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels
Hessam Mahdavifar, Fariba Abbasi
In a classical wiretap channel setting, Alice communicates with Bob through a main communication channel, while her transmission also reaches an eavesdropper Eve through a wiretap…