IEEE Trans. Information Theory 2019

258 papers
The 2019 edition of IEEE Transactions on Information Theory published 38 papers addressing core problems in coding theory, network analysis, and signal processing. A primary focus was the development of deterministic constructions for optimal information-theoretic codes, including locally repairable codes and synchronization codes for insertion and deletion channels. Research also emphasized advancements in group testing, specifically regarding sparse combinatorial methods and the effects of dilution in pooled diagnostic testing. Additionally, the volume explored the intersection of information theory and network science through studies on higher-order network motifs, simplicial message passing, and spectral graph neural networks for directed graphs. Other research areas included DNA sequence design, the optimization of heterogeneous coded caching, and the minimization of the Age of Information in queuing systems. Prolific authors contributing to these themes included Hikmet Yıldız, Alex Dytso, Shlomo Shamai, and Sergio Verdú. The year’s work reflected a trend toward scaling information theory beyond binary alphabets and applying its principles to complex biological and networked data structures.

Top Research Directions

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

The Statistical Computational Gap in High Dimensions 6
From Non-Constructive Existence to Explicit Code Constructions 6
Compress and Forward Relaying with Side Information 5
Beyond the Symmetric Channel Assumption in Wireless Networks 4
Optimizing Repair Bandwidth for Distributed Erasure Codes 4
State Evolution for High Dimensional Inference 3
Semidefinite Programming for Quantum Resource Optimization 3
Robust Approximate Message Passing for Structured Matrices 3
The Finite Blocklength Performance Gap 3
Secrecy Rate Trade Offs in Broadcast Channels 3
Phase Retrieval from Intensity Measurements 3
Basins of Attraction in Nonconvex Optimization 3
Balancing Data Privacy and System Utility 3
Graph Theoretic Analysis of Distributed Storage Capacity 2
Learning From Unlabeled Mixtures of Structured Models 2

Top Authors

AuthorPapers
Vincent Y. F. Tan9
Arash Gholami Davoodi4
Ayfer Ozgur3
Jonathan Scarlett3
Jun Chen3
Mehul Motani3
Oliver Kosut3
Philip Schniter3
Rebecca Willett3
Salman Avestimehr3
Xin Wang3
Aarti Singh2
Amir Leshem2
Arya Mazumdar2
Ashish J Khisti2
Babak Khalaj2
Dong Yin2
Farhad Shirani2
Flavio Calmon2
H. Vincent Poor2

Impactful Papers

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

Foundational

Influential

Papers

Title
Game Theoretic Dynamic Channel Allocation for Frequency-Selective Interference Channels
Generalized Compression Strategy for the Downlink Cloud Radio Access Network
Generalized Compute-Compress-and-Forward
Generalized Random Gilbert-Varshamov Codes
Generalized Sphere-Packing Bound for Subblock-Constrained Codes
Globally Convergent Levenberg-Marquardt Method for Phase Retrieval
Goodness-of-Fit Tests on Manifolds
High Dimensional Inference With Random Maximum A-Posteriori Perturbations
How Much Does Your Data Exploration Overfit? Controlling Bias via Information Usage
Hypothesis Testing Over the Two-Hop Relay Network
IEEE Transactions on Information Theory publication information
Inference under Information Constraints II: Communication Constraints and Shared Randomness
Information Flow in Computational Systems
Interference Mitigation via Relaying
Intrinsic Capacity
K-User Interference Channels With Backhaul Cooperation: DoF vs. Backhaul Load Trade-Off
Lattice-Based Robust Distributed Source Coding
Lattice Functions for the Analysis of Analog-to-Digital Conversion
Learning High-Dimensional Generalized Linear Autoregressive Models
Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes
Learning to Detect an Odd Markov Arm
Linear Programming Approximations for Index Coding
List-Decodable Zero-Rate Codes
List Decoding Random Euclidean Codes and Infinite Constellations
Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
Matching Anonymized and Obfuscated Time Series to Users' Profiles
Maximizing the Number of Spanning Trees in a Connected Graph
Mean Estimation From One-Bit Measurements
Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources
MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages
Minimax Rate Optimal Adaptive Nearest Neighbor Classification and Regression
Minimizing the Age of Information Through Queues
Moderate Deviation Asymptotics for Variable-Length Codes With Feedback
Motif and Hypergraph Correlation Clustering
Multi-Armed Bandits With Correlated Arms
Multireference Alignment Is Easier With an Aperiodic Translation Distribution
Nearly Optimal Constructions of PIR and Batch Codes
Nearly Optimal Sparse Group Testing
Near Optimal Coded Data Shuffling for Distributed Learning
Network Estimation From Point Process Data
Network Simplification in Half-Duplex: Building on Submodularity
New Bounds and Generalizations of Locally Recoverable Codes With Availability
Noisy Adaptive Group Testing: Bounds and Algorithms
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort
Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
Non-Asymptotic Entanglement Distillation
Nonparametric Identification in the Dynamic Stochastic Block Model
On Converse Bounds for Classical Communication Over Quantum Channels
On Function Computation With Privacy and Secrecy Constraints
On Non-Interactive Simulation of Binary Random Variables

« prev Page 3/6 next »