most citedOptimal Rate Irregular LDPC Codes in Binary Erasure Channel

1 citations · 1 across the 1 of their papers we have counts for

collaborators

6 papers

cs.IT2026

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…

cs.IT2026

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…

cs.IT2026

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…

cs.IT2026

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…

cs.IT2026

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…

cs.IT20121 cited

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…