IEEE Trans. Information Theory 2022

220 papers
The 2022 edition of IEEE Transactions on Information Theory featured research across classical information theory, coding theory, and emerging applications in networked systems. Significant attention was directed toward resource allocation in restless stochastic environments and the minimization of the Age of Incorrect Information. Group testing remained a prominent theme, with studies addressing asymmetric noise and efficient methods for large-scale screening. Other core research areas included state estimation in infrastructure networks and the application of stochastic transmission noise to infectious disease models. Methodological trends included the integration of kernel methods with information theory and the exploration of quantum circuits. Coding theory research focused on array codes with local properties and q-ary non-overlapping codes. Additionally, the volume addressed privacy-signaling games and the MMSE information bottleneck problem for Gaussian sources. Notable contributions involved near-field communication using large antenna arrays and robust beamforming under imperfect channel state information. Prolific contributors to this year's volume included Vaneet Aggarwal, Hao-Chung Cheng, and Min-Hsiu Hsieh.

Top Research Directions

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

Optimizing Information Freshness in Real Time Networks 5
Signal Reconstruction from One-Bit Quantized Measurements 3
From Non-Constructive Existence to Explicit Code Constructions 3
The Spectral Phase Transition in High Dimensional Inference 3
Tightening Theoretical Bounds by Optimizing Constant Factors 3
Straggler-Resilient Coded Computation 3
The Mechanics of Benign Overfitting in High Dimensions 3
Overcoming the Exponential Bottleneck in Tensor Decompositions 3
Coding Theory for Asymmetric Error Channels 2
Asymptotic Optimality of Index Policies for Resource Allocation 2
Sub Quadratic Sample Complexity for Tensor Completion 2
The Finite Sample Gap in Asymptotic Guarantees 2
Coded Caching for Non-Uniform Content Popularity 2
Asynchronous Signal Recovery in Massive Random Access 2
Noise Robust Tensor Decomposition 2

Top Authors

AuthorPapers
Alfred O. Hero3
Antonia Wachter-Zeh3
Aryeh Kontorovich3
Ashish J Khisti3
Deniz Gunduz3
Jonathan Scarlett3
Kannan Ramchandran3
Yuan Luo3
Avishek Ghosh2
Banghua Zhu2
Cheuk Ting Li2
Cong Ma2
Farzad Farnoud2
Hao-Chung Cheng2
Jiantao Jiao2
Marco Bondaschi2
Mert Pilanci2
Min Dong2
Min-Hsiu Hsieh2
Mohsen Heidari2

Impactful Papers

Papers from IEEE Trans. Information Theory 2022 that shaped research clusters.

Foundational

Influential

Papers

Title
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically
Performance Bounds for Group Testing With Doubly-Regular Designs
Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO
PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access
Precoding and Scheduling for AoI Minimization in MIMO Broadcast Channels
Privacy of Synthetic Data: A Statistical Framework
Provable Compressed Sensing With Generative Priors via Langevin Dynamics
Provably Efficient Offline Reinforcement Learning With Trajectory-Wise Reward
Q-Ary Non-Overlapping Codes: A Generating Function Approach
Quadratically Constrained Myopic Adversarial Channels
Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources
Quantizing Heavy-Tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery
Quantum Algorithm for Fidelity Estimation
Quantum Differentially Private Sparse Regression Learning
Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography
Quaternary Linear Codes and Related Binary Subfield Codes
Quickest Inference of Network Cascades With Noisy Information
Rank and Pairs of Rank and Dimension of Kernel of ZpZp²-Linear Codes
Recovery of Future Data via Convolution Nuclear Norm Minimization
Repairing Reed-Solomon Codes Evaluated on Subspaces
Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
Sampling With Replacement vs Poisson Sampling: A Comparative Study in Optimal Subsampling
Second-Order Asymptotically Optimal Outlier Hypothesis Testing
Secrecy Analysis for IRS-Aided Wiretap MIMO Communications: Fundamental Limits and System Design
Secure Distributed Matrix Computation With Discrete Fourier Transform
Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel
Sequential Multi-Hypothesis Testing in Multi-Armed Bandit Problems: An Approach for Asymptotic Optimality
Sequential Transmission Over Binary Asymmetric Channels With Feedback
Simple Coding Techniques for Many-Hop Relaying
SLOPE for Sparse Linear Regression: Asymptotics and Optimal Regularization
Some Upper Bounds and Exact Values on Linear Complexities Over FM of Sidelnikov Sequences for M = 2 and 3
Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference
Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations
Stability and Risk Bounds of Iterative Hard Thresholding
State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks
Storage Codes With Flexible Number of Nodes
Strong Data Processing Constant Is Achieved by Binary Inputs
Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints
Structures of Spurious Local Minima in k-Means
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization
Symmetric Private Polynomial Computation From Lagrange Encoding
Tensor Principal Component Analysis in High Dimensional CP Models
The Benefits of Diversity: Permutation Recovery in Unlabeled Sensing From Multiple Measurement Vectors
The Differential Entropy of Mixtures: New Bounds and Applications
The DNA Storage Channel: Capacity and Error Probability Bounds
The Eigenvectors of Single-Spiked Complex Wishart Matrices: Finite and Asymptotic Analyses
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences
The Price of Competition: Effect Size Heterogeneity Matters in High Dimensions

« prev Page 4/5 next »