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
Linear Phaseless Retrieval of Functions in Spline Spaces With Arbitrary Knots
List Decoding Random Euclidean Codes and Infinite Constellations
Lower Bound on the Capacity of the Continuous-Space SSFM Model of Optical Fiber
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes
Lower Bounds on the Generalization Error of Nonlinear Learning Models
Macroscopic Analysis of Vector Approximate Message Passing in a Model-Mismatched Setting
Max-Affine Regression: Parameter Estimation for Gaussian Designs
Mean Estimation From One-Bit Measurements
Measuring Information From Moments
Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands
Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution
Minimax Off-Policy Evaluation for Multi-Armed Bandits
Minimum Excess Risk in Bayesian Learning
Mismatched Decoding Reliability Function at Zero Rate
Multiple Criss-Cross Insertion and Deletion Correcting Codes
Multiple Packing:Lower Bounds via Infinite Constellations
Multi-Server Weakly-Private Information Retrieval
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
Nearest Neighbor Density Functional Estimation From Inverse Laplace Transform
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms
New Constructions of Complementary Sequence Pairs Over 4q-QAM
New Quantum Algorithms for Computing Quantum Entropies and Distances
New Spectrally Constrained Sequence Sets With Optimal Periodic Cross-Correlation
Noisy Adaptive Group Testing via Noisy Binary Search
Non-binary Codes for Correcting a Burst of at Most t Deletions
Non-Parametric Quickest Mean-Change Detection
On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies
On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization
On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers
On Penalization in Stochastic Multi-Armed Bandits
On Smooth Rényi Entropies: A Novel Information Measure, One-Shot Coding Theorems, and Asymptotic Expansions
On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals
On the Best Choice of Lasso Program Given Data Parameters
On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
On the Generalized Covering Radii of Reed-Muller Codes
On the Global Optimality of Whittle's Index Policy for Minimizing the Age of Information
On the Rate of Convergence of a Classifier Based on a Transformer Encoder
On the Similarity Between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets
Optimal Age Over Erasure Channels
Optimal Aggregation Strategies for Social Learning Over Graphs
Optimal Convergence Rates for the Orthogonal Greedy Algorithm
Optimal Distributed Composite Testing in High-Dimensional Gaussian Models With 1-Bit Communication
Optimal High-Order Tensor SVD via Tensor-Train Orthogonal Iteration
Optimal Locally Repairable Codes: An Improved Bound and Constructions
Optimal Nonparametric Multivariate Change Point Detection and Localization
Optimal Randomized Approximations for Matrix-Based Rényi's Entropy
Optimizing Age-of-Information in Adversarial and Stochastic Environments
Optimizing Variational Representations of Divergences and Accelerating Their Statistical Estimation

« prev Page 3/5 next »