| Publication | Date of Publication | Type |
|---|
| Observations on the Lov\'asz $\theta$-Function, Graph Capacity, Eigenvalues, and Strong Products | 2023-01-07 | Paper |
| Information Inequalities via Submodularity and a Problem in Extremal Graph Theory | 2022-04-28 | Paper |
| Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs | 2021-06-14 | Paper |
| On Two-Stage Guessing | 2021-04-09 | Paper |
| A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs | 2020-12-22 | Paper |
| Some Useful Integral Representations for Information-Theoretic Analyses | 2020-05-12 | Paper |
| On Relations Between the Relative entropy and $\chi^2$-Divergence, Generalizations and Applications | 2020-04-23 | Paper |
| An Integral Representation of the Logarithmic Function with Applications in Information Theory | 2019-12-12 | Paper |
| On Data-Processing and Majorization Inequalities for $f$-Divergences with Applications | 2019-11-06 | Paper |
| Tight Bounds on the R\'enyi Entropy via Majorization with Applications to Guessing and Compression | 2018-12-08 | Paper |
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
| On $f$-Divergences: Integral Representations, Local Behavior, and Inequalities | 2018-04-17 | Paper |
Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On Universal Properties of Capacity-Approaching LDPC Code Ensembles
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Entropy Bounds for Discrete Random Variables via Maximal Coupling
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
$f$ -Divergence Inequalities
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Projection Theorems for the Rényi Divergence on $\alpha $ -Convex Sets
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Achieving Marton’s Region for Broadcast Channels Using Polar Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On Rényi Entropy Power Inequalities
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| $f$-Divergence Inequalities via Functional Domination | 2016-10-28 | Paper |
| Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications | 2015-10-10 | Paper |
| On Reverse Pinsker Inequalities | 2015-03-24 | Paper |
| Upper Bounds on the Relative Entropy and R\'enyi Divergence as a Function of Total Variation Distance for Finite Alphabets | 2015-03-11 | Paper |
Improved lower bounds on the total variation distance for the Poisson approximation
Statistics & Probability Letters | 2014-02-19 | Paper |
Concentration of measure inequalities in information theory, communications, and coding
Foundations and Trends in Communications and Information Theory | 2014-01-08 | Paper |
Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps
Statistics & Probability Letters | 2013-12-06 | Paper |
| On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method | 2012-07-02 | Paper |
| An Information-Theoretic Perspective of the Poisson Approximation via the Chen-Stein Method | 2012-06-28 | Paper |
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
On Achievable Rate Regions for the Gaussian Interference Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the Error Exponents of Improved Tangential Sphere Bounds
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
Foundations and Trends™ in Communications and Information Theory | 2008-09-01 | Paper |
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial
Foundations and Trends™ in Communications and Information Theory | 2007-02-23 | Paper |
Variations on the Gallager bounds, connections, and applications
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Variations on the Gallager bounds with some applications
Physica A | 2002-01-06 | Paper |
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
On interleaved, differentially encoded convolutional codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Observations on Graph Invariants with the Lov\'asz $\vartheta$-Function
(available as arXiv preprint) | N/A | Paper |
