7 citations · 8 across the 10 of their papers we have counts for
13 papers
AoI-Aware Polar Code Blind Rate Adaptation
Hassan Tavakoli
We study adaptive prefix-length selection for reliability-ordered coded transmission over coordinates, using only the most reliable, to balance age of information (AoI) aga…
Chi-Squared Geometry for Robust Finite-Blocklength Information and Dispersion Analysis
Hassan Tavakoli, Thinh Nguyen, Bella Bose
We develop a column-wise chi-squared geometry for discrete memoryless channels (DMCs) yielding tight, logarithm-free bounds on mutual information, channel dispersion, and finite-bl…
Combinatorial Capacity Bounds for the -ary Deletion Channel
Hassan Tavakoli, Thinh Nguyen, Bella Bose
We study the \(q\)-ary deletion channel via the pattern-count scalar \(N_n(x,y)\), the number of deletion subsets mapping \(x\inΣ_q^n\) to \(y\inΣ_q^k\), which factorizes the trans…
Guesswork Under Linear Constraints: Exact Exponent for Coset Decoding
Hassan Tavakoli
We establish the exact exponential growth rate of the -th moment of the constrained guesswork -- the rank of the true noise vector within its syndrome coset…
RankGuardPolar Private Public Finite Length Polar Codes with Rank-Certified Leakage
Hassan Tavakoli, Thinh Nguyen, Bella Bose
We introduce \textbf{RankGuard-Polar}, a framework for safely publishing a subset of polar codeword coordinates over shared public resources. We assume a strong eavesdropper who ha…
Parameter Estimation of Mutual Information Maximized Channels
Hassan Tavakoli, Thinh Nguyen, Bella Bose
We study the problem of estimating a parametric discrete memoryless channel \( p(y \mid x; \boldsymbolθ) \) when the transmitter selects its input distribution \( π\) to maximize m…
New Capacity Upper Bounds For Binary Deletion Channel
Hassan Tavakoli
This paper considers a binary channel with deletions. We derive two closed-form upper bounds on the capacity of the binary deletion channel (BDC). The first bound is obtained by co…
Source and Channel Optimal Rate LDPC Code Design for one Sender in BE-MAC with Source Correlation
Hassan Tavakoli
In this paper, we present an extension of the semidefinite programming formulation of the optimal rate code design in single link Binary Erasure Channel (BEC) proposed by the autho…
Reducing the Complexity of the Linear Programming Decoding
Hassan Tavakoli
In this paper we show how the complexity of Linear Programming (LP) decoder can decrease. We use the degree 3 check equation to model all variation check degrees. The complexity of…
A Fast Convergence Density Evolution Algorithm for Optimal Rate LDPC Codes in BEC
Hassan Tavakoli
We derive a new fast convergent Density Evolution algorithm for finding optimal rate Low-Density Parity-Check (LDPC) codes used over the binary erasure channel (BEC). The fast conv…
Optimal Rate Irregular LDPC Codes in Binary Erasure Channel
H. Tavakoli, M. Ahmadian, M. Reza Peyghami
In this paper, we design the optimal rate capacity approaching irregular Low-Density Parity-Check code ensemble over Binary Erasure Channel, by using practical Semi-Definite Progra…
Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel
H. Tavakoli, M. Ahmadian Attari, M. R. Peyghami
In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure…
Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel
H. Tavakoli, M. Ahmadian Attari, M. Reza Peyghami
In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check…