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
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
On the Capacity of Channels with Deletions and States
On the Capacity of Cloud Radio Access Networks With Oblivious Relaying
On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation Theoretic Perspective
On the Convergence of Approximate Message Passing With Arbitrary Matrices
On the Entropy Power Inequality for the Rényi Entropy of Order [0, 1]
On the Gaussianity of Kolmogorov Complexity of Mixing Sequences
On the Maximum Size of Block Codes Subject to a Distance Criterion
On the Minimal Overcompleteness Allowing Universal Sparse Representation
On the Minimax Misclassification Ratio of Hypergraph Community Detection
On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection
On the Robustness of Information-Theoretic Privacy Measures and Mechanisms
On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization
On the Sub-Optimality of Single-Letter Coding Over Networks
Optimal Age Over Erasure Channels
Optimality of Simple Layered Superposition Coding in the 3 User MISO BC With Finite Precision CSIT
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays
Optimal Nonparametric Multivariate Change Point Detection and Localization
Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
Optimal Streaming Erasure Codes Over the Three-Node Relay Network
Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization
Optimization of Heterogeneous Coded Caching
Optimization of Smooth Functions With Noisy Observations: Local Minimax Rates
Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM
Performance of Group Testing Algorithms With Near-Constant Tests Per Item
Phase Transition Analysis for Covariance Based Massive Random Access with Massive MIMO
Physical-Layer Schemes for Wireless Coded Caching
Polar Coding for Processes With Memory
Privacy With Estimation Guarantees
Private Hypothesis Selection
Private Information Retrieval With Side Information
Provable Subspace Clustering: When LRR Meets SSC
Quantized Compressed Sensing by Rectified Linear Units
Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes
Quantum Query Complexity of Entropy Estimation
Quantum State Merging for Arbitrarily Small-Dimensional Systems
Quasi Structured Codes for Multi-Terminal Communications
Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis
Rack-Aware Regenerating Codes for Data Centers
Recovery and Convergence Rate of the Frank-Wolfe Algorithm for the m-Exact-Sparse Problem
Recovery of Future Data via Convolution Nuclear Norm Minimization
Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources
Rényi Resolvability and Its Applications to the Wiretap Channel
Repairing Multiple Failures for Scalar MDS Codes
Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols
Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements

« prev Page 4/6 next »