ISIT 2010

178 papers
The 2010 International Symposium on Information Theory (ISIT) featured 189 papers covering interference management, distributed storage, and cooperative communication. Research focused on interference alignment, rational dimensions, and message splitting to address wireless network density. Distributed storage was a central theme, specifically regarding secure regenerating codes and secrecy capacity during node repair. The proceedings also detailed capacity bounds for Gaussian relay networks and the use of backward decoding and partial decode-and-forward strategies. Other research directions involved sparsity in weighted optimization, low-rank recovery, and variable-length coding in the non-asymptotic regime. Prolific authors such as Shlomo Shamai, H. Vincent Poor, and Suhas N. Diggavi contributed to these areas, alongside studies on bivariate Gaussian sources and universal compression-based denoising.

Top Research Directions

Research directions most represented by ISIT 2010 papers.

Overcoming Idealized Assumptions in Channel Modeling 3
Securing Distributed Storage Against Repair Induced Vulnerabilities 2
Generalizing Information Theory Beyond Discrete Memoryless Channels 2
Communication with Asymmetric Channel State Information 2
Information Theory for Short Packet Wireless Communications 2
The Limits of Wireless Network Densification 2
Bounding Stochastic Process Runtimes via Auxiliary Models 1
The Missing Piece Syndrome in Peer to Peer Networks 1
Subspace Coding for Vector Network Communication 1
Adaptive Sampling for Efficient Data Acquisition 1
Graph Theoretic Code Construction for Local Recovery 1
Tuning Mode Selection via Parameterized Divergence Minimization 1
Backward Decoding in Cooperative Communication 1
Zero-Error Communication with Variable-Length Feedback 1
Markovian State Space Analysis for Dynamic Systems 1

Top Authors

AuthorPapers
Toshiyuki Tanaka5
Anant Sahai4
Mohammad Reza Aref4
Pablo Piantanida4
Alon Orlitsky3
Jayadev Acharya3
Jun Chen3
Robert D Nowak3
Tsachy Weissman3
Vaneet Aggarwal3
Alexandre Graell i Amat2
Ali Tajer2
Andrea Montanari2
Arya Mazumdar2
Benjamin Recht2
Chao Tian2
Christina Fragouli2
Deniz Gunduz2
Douglas Leith2
Fernando Perez-Cruz2

Impactful Papers

Papers from ISIT 2010 that shaped research clusters.

Foundational

Influential

Papers

Title
Statistical mechanical analysis of compressed sensing utilizing correlated compression matrix
Stopping set analysis of 3-dimensional turbo code ensembles
Sum capacity of general deterministic interference channel with channel output feedback
Sum rate of the vacationing CEO problem
The achievable distortion region of bivariate Gaussian source on Gaussian broadcast channel
The capacity-equivocation region of the MIMO Gaussian wiretap channel
The capacity of the uniform noise rewritable channel with average cost
The capacity region of fading Multiple Access Channels with cooperative encoders and partial CSIT
The dynamics of message passing on dense graphs, with applications to compressed sensing
The limits of error correction with lp decoding
The linear complexity of binary sequences with optimal autocorrelation
The missing piece syndrome in peer-to-peer communication
The role of game theory in key agreement over a public channel
The SIMO pre-log can be larger than the SISO pre-log
The two-user deterministic interference channel with rate-limited feedback
Tight asymptotic bounds for the deletion channel with small deletion probabilities
Transport capacity and connectivity of Cognitive Radio networks with outage constraint
Tree-structure expectation propagation for decoding LDPC codes over binary erasure channels
Two-way transmission capacity of wireless ad-hoc networks
Typicality graphs and their properties
Universal estimation of directed information
Universal hypothesis testing in the learning-limited regime
Universal lossless compression-based denoising
Variable-length coding with feedback in the non-asymptotic regime
Vector network coding algorithms
Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices
Where is randomness needed to break the square-root bottleneck?
Zero-forcing for the symmetric Interference Channel with conferencing encoders

« prev Page 4/4