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.
Top Authors
Impactful Papers
Papers from IEEE Trans. Information Theory 2019 that shaped research clusters.
Foundational
On the Entropy Power Inequality for the Rényi Entropy of Order [0, 1]
foundational
Entropy Bounds for Sums of Random Variab
On the Entropy Power Inequality for the Rényi Entropy of Order [0, 1]
foundational
Analyzing Log-Concave Distributions via
Influential
The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding
influential
Threshold Saturation via Spatially Coupl
Communication for Generating Correlation: A Unifying Survey
influential
Generating Common Randomness from Correl
Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes
influential
Iterative Peeling Decoders for Sparse Re
On the Maximum Size of Block Codes Subject to a Distance Criterion
influential
Zero-Error Communication with Variable-L
Aligned Image Sets and the Generalized Degrees of Freedom of Symmetric MIMO Interference Channel wit
influential
The Linear Deterministic Approach to Wir
On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization
influential
Atomic Norm Minimization for Off the Gri
Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonc
influential
Signal Recovery Beyond the Gaussian Meas
Consistent Tomography Under Partial Observations Over Adaptive Networks
influential
Network Topology Inference Under Partial