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
Codes With Locality in the Rank and Subspace Metrics
Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength
Collaborative Information Bottleneck
Communication for Generating Correlation: A Unifying Survey
Community Recovery in a Preferential Attachment Graph
Community Recovery in Hypergraphs
Connectivity of Inhomogeneous Random K-Out Graphs
Consistent Tomography Under Partial Observations Over Adaptive Networks
Construction of Asymptotically Good Locally Repairable Codes via Automorphism Groups of Function Fields
Construction of Polar Codes With Sublinear Complexity
Context-Aware Resiliency: Unequal Message Protection for Random-Access Memories
Control Capacity
Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation
Convergence Rate of Empirical Spectral Distribution of Random Matrices from Linear Codes
Convex Formulation of Overparameterized Deep Neural Networks
Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information
Coordination Through Shared Randomness
Corrections to "Fine Asymptotics for Universal One-to-One Compression of Parametric Sources"
Correction to Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering
Correction to Efficient Computation of Normalized Maximum Likelihood Codes for Gaussian Mixture Models With Its Applications to Clustering [Nov 13 7718-7727]
Covert Communication With Polynomial Computational Complexity
Data-Dependent Generalization Bounds for Multi-Class Classification
Data Encoding for Byzantine-Resilient Distributed Optimization
Decoding From Pooled Data: Phase Transitions of Message Passing
Degrees-of-Freedom of the MIMO Three-Way Channel With Node-Intermittency
Detection Under One-Bit Messaging Over Adaptive Networks
Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor
Differential Spectrum of Kasami Power Permutations Over Odd Characteristic Finite Fields
Displacement Convexity in Spatially Coupled Scalar Recursions
Distributed Detection with Empirically Observed Statistics
Distributed Source Simulation With No Communication
Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities
Efficiently Decodable Non-Adaptive Threshold Group Testing
Estimating the Coefficients of a Mixture of Two Linear Regressions by Expectation Maximization
Estimating the Fundamental Limits is Easier Than Achieving the Fundamental Limits
Estimation Efficiency Under Privacy Constraints
Estimation in Poisson Noise: Properties of the Conditional Mean Estimator
Estimation in Tournaments and Graphs Under Monotonicity Constraints
Estimation of Poisson Arrival Processes Under Linear Models
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion
Explicit and Efficient WOM Codes of Finite Length
Exponential Error Rates of SDP for Block Models: Beyond Grothendieck's Inequality
Expurgated Bounds for the Asymmetric Broadcast Channel
Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes
Faithful Simulation of Distributed Quantum Measurements With Applications in Distributed Rate-Distortion Theory
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons
Fine Asymptotics for Universal One-to-One Compression of Parametric Sources
Fundamental Limits of Cloud and Cache-Aided Interference Management With Multi-Antenna Edge Nodes
Fundamental limits of many-user MAC with finite payloads and fading
Gabidulin Codes With Support Constrained Generator Matrices

« prev Page 2/6 next »