IEEE Trans. Information Theory 2009

134 papers
The 2009 edition of IEEE Transactions on Information Theory emphasized the performance limits and scaling behavior of error-correcting codes. A central theme was the study of finite-length scaling and threshold saturation, particularly concerning iteratively decoded Low-Density Parity-Check (LDPC) ensembles. Research also explored phase transitions in error-correcting codes, providing insights into how these systems transition between different states of reliability and efficiency. Specific studies addressed the mathematical properties of information measures, such as the Hessian and concavity of mutual information and entropy power in linear vector Gaussian channels. Other work focused on source-channel coding for dirty-paper code design and the error exponents of variable-length codes over Markov channels with feedback. Prolific contributors to these topics included Daniel P. Palomar, Miquel Payaró, Zixiang Xiong, and Giacomo Como. Additionally, the year saw advancements in combinatorial bounds for $(m, k, \lambda)$-IRSs. These collective works represent a focus on refining the theoretical foundations of channel capacity and coding efficiency under various channel models.

Top Research Directions

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

Information-Theoretic Converse Bounds for Networks 4
Modular Separation of Source and Channel Coding 3
Generalizing Information Theory Beyond Discrete Memoryless Channels 3
Generalizing Information Theory to Continuous Alphabets 3
Generalizing Network Algorithms to Arbitrary Topologies 3
Sparse Signal Recovery from Underdetermined Measurements 3
The Empirical Validation Gap 3
Global Optimality Guarantees for Max Product Belief Propagation 2
Compress and Forward Relaying with Side Information 2
Generalizing Binary Sequence Frameworks to Non-Binary Alphabets 2
Generalizing Performance Scaling Laws to Realistic Noise Channels 2
Adaptive Sparse Estimation with Unknown Sparsity 2
Spatial Point Processes for Wireless Network Analysis 2
Bounding the Capacity Gap in Gaussian Relay Networks 2
Preserving Signal Geometry for Sparse and Low Rank Recovery 2

Top Authors

AuthorPapers
H. Vincent Poor9
Oren Somekh6
Chao Tian4
Jun Chen4
Martin J Wainwright4
Andrea Goldsmith3
Deniz Gunduz3
Sanjeev Kulkarni3
Tsachy Weissman3
Devavrat Shah2
Husheng Li2
Mike Davies2
Pedram Pad2
Rémi Gribonval2
Wei Yu2
Aditya Mahajan1
Alexandre Proutiere1
Alex Dimakis1
Ananthram Swami1
Atri Rudra1

Impactful Papers

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

Foundational

Influential

Papers

Title
Remote vector Gaussian source coding with decoder side information under mutual information and distortion constraints
Representation and Compression of Multidimensional Piecewise Functions Using Surflets
Restricted isometry constants where lpsparse recovery can fail for 0 < p <= 1
Restricted isometry constants where lsparse recovery can fail for 0 < p <= 1
Robust recovery of signals from a structured union of subspaces
Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages
Secret-Key Generation using Correlated Sources and Channels
Secure Source Coding with a Helper
Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness
Sequential Anomaly Detection in the Presence of Noise and Limited Feedback
Sharp bounds for optimal decoding of low-density parity-check codes
Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso)
Shift-invariant protocol sequences for the collision channel without feedback
Sided and symmetrized Bregman centroids
Source and channel coding for correlated sources over multiuser channels
Sparse Recovery From Combined Fusion Frame Measurements
Spectrum Management for Interference-Limited Multiuser Communication Systems
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions
Subspace pursuit for compressive sensing signal reconstruction
The Capacity Region of a Class of Semideterministic Interference Channels
The capacity region of the degraded multiple-input multiple-output compound broadcast channel
The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback
The generalized area theorem and some of its consequences
The Impact of Mobility on Gossip Algorithms.
The Trapping Redundancy of Linear Block Codes
The two-user compound interference channel
Tree-based ranking methods
Unequal error protection: an information-theoretic perspective
Universal models for the exponential distribution
Uplink macro diversity of limited backhaul cellular network
Vector Gaussian Multiple Description With Two Levels of Receivers
Weighted superimposed codes and constrained integer compressed sensing
Wireless Network Information Flow: A Deterministic Approach

« prev Page 3/3