IEEE Trans. Information Theory 2026

89 papers
The 2026 edition of IEEE Transactions on Information Theory includes research on information measures, statistical inference, and communication theory. Published works explore neural entropic optimal transport, Gromov–Wasserstein alignment, and the efficient approximation of regularized relative entropies. Statistical research focuses on improving Wald’s sequential probability ratio test and developing robust clustering methods for general mixture models. In communication and network theory, the year’s papers address the Age of Information under sequence-based scheduling and optimal non-adaptive group testing with one-sided error guarantees. Additional studies examine the output statistics of random binning through Tsallis divergence and the relationship between majorizing measures and coding theory. Prolific authors contributing to these developments include Tao Wang, Chung Shue Chen, Omar Fawzi, and Hamza Fawzi. The research collectively emphasizes the refinement of mathematical frameworks for data analysis and information transmission.

Top Research Directions

Research directions most represented by IEEE Trans. Information Theory 2026 papers.

Anytime Valid Inference via Testing by Betting 2
Tuning Mode Selection via Parameterized Divergence Minimization 1
The Computational Cost of Robust Estimation 1
Partial Information Decomposition 1
Simplifying Complex Proofs for Mathematical Accessibility 1
Symmetry Preservation in Variational Quantum Circuits 1
Semidefinite Programming for Quantum Resource Optimization 1
Threshold Saturation via Spatially Coupled Codes 1
Joint Activity and Data Detection for Grant-Free Access 1
Anytime Valid Inference for Continuous Data Monitoring 1
The Locality Distance Tradeoff in Erasure Coding 1
Dynamic Sparsity Adaptation for Signal Recovery 1
Mechanisms for Rapid Iterative Convergence 1
The Intractability of Multi-Letter Channel Capacities 1
Scalable Resampling for Large Scale Statistical Inference 1

Top Authors

AuthorPapers
Sanjeev Kulkarni2
Arash Gholami Davoodi1
Bhavya Kumar Agrawalla1
Chung Shue Chen1
Jason Altschuler1
jatin batra1
Jianqing Fan1
Longxiu Huang1
Mohammad Hossein Yassaee1
Mohammad Reza Aref1
Piyush Srivastava1
Promit Ghosal1
Ramji Venkataramanan1
Santanu Das1
Shiqiang Wang1
Shirley Xiaoqi Liu1
Sinho Chewi1
Soham Jana1
Syed Jafar1
Tao Guo1

Papers

Title
Nonasymptotic Oblivious Relaying and Variable-Length Noisy Lossy Source Coding
On de Bruijn Array Codes - Part II: Pseudo-Random Array Codes
On Excess Risk Convergence Rates of Neural Network Classifiers
On Information Theoretic Fairness: From Perfect to Bounded Demographic Parity
On the Strong Converse Exponent and Error Exponent of the Classical Soft Covering
Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion
Optimality of Meta-Converse for Channel Simulation
Optimal Non-Adaptive Group Testing with One-Sided Error Guarantees
Optimal Online Bookmaking for Binary Games
Optimal Quantum (r,δ)-Locally Repairable Codes From Matrix-Product Codes
Optimal Sequential Recommendations: Exploiting User and Item Structure
Output Statistics of Random Binning: Tsallis Divergence and Its Applications
Performance Bounds on Pliable Index Coding Using Absent Receivers
Phase Retrieval and Matrix Sensing via Benign and Overparametrized Nonconvex Optimization
Phase Transitions of the Additive Uniform Noise Channel With Peak Amplitude and Cost Constraint
Private Sum Computation: Trade-Offs Between Communication, Randomness, and Privacy
Quantum Codes Using the $\tau$ -OD MP Construction
Randomized Space-Time Sampling for Affine Graph Dynamical Systems
Random Multiplexing
Resolution Limits of Non-Adaptive 20 Questions Estimation for Tracking Multiple Moving Targets
Revisiting Weighted Strategy for Non-Stationary Parametric Bandits and MDPs
Robustness of Covariance Estimators for Non-Negative Sparse Recovery at Minimal Sampling Rate
Secure Coded Caching: Exact End-Points and Tighter Bounds
Self-Orthogonal Codes From Plateaued Functions and Their Applications in Quantum Codes and LCD Codes
Self-Orthogonal Codes From Vectorial Dual-Bent Functions
Sequential Change Detection With Differential Privacy
Sharp High-Probability Rates for Nonlinear SGD Under Heavy-Tailed Noise via Symmetrization
Shifted Composition II: Shift Harnack Inequalities and Curvature Upper Bounds
Simultaneous Inference for Covariance and Precision Matrices of Long-Range Dependent Time Series
Sliding Finite Window Codes: Near-Optimality and Q-Learning for Zero-Delay Coding
Statistical Inference for Linear Functionals of Online Least-Squares SGD When t ≳ d1+δ
Support-Guessing Decoding Algorithms in the Sum-Rank Metric
The Covering Radius of Group Codes
The t-Designs and the Subcode Support Weight Distributions of r-GMDS Codes
The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
Timely CPU Scheduling for Computation-Intensive Status Updates
Two Fast Erasure Decoding Algorithms for Reed-Solomon Codes Based on LCH-FFT
Uhlmann's Theorem for Measured Divergences
Universal Discrete Filtering With Lookahead or Delay

« prev Page 2/2