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
On reconstructing a string from its substring compositions
On secure distributed data storage under repair dynamics
On the capacity of compound state-dependent channels with states known at the transmitter
On the capacity of the half-duplex diamond channel
On the capacity region of a multiple access channel with common messages
On the capacity region of the Poisson interference channels
On the degrees of freedom of the compound MISO broadcast channels with finite states
On the deletion channel with small deletion probability
On the error exponent to redundancy ratio of interactive encoding and decoding
On the excess distortion exponent of the quadratic-Gaussian Wyner-Ziv problem
On the optimality of multi-hop communication in large wireless networks
On the scaling of polar codes: II. The behavior of un-polarized channels
On the scaling of polar codes: I. The behavior of polarized channels
On the secrecy degress of freedom of the multi-antenna block fading wiretap channels
On the secure DoF of the single-antenna MAC
On the separation of lossy source-network coding and channel coding in wireline networks
On the sum rate of vector Gaussian multiterminal source coding
On the weighted sum-rate capacity of broadcast channels that generate interference
Opportunistic capacity and error exponent regions for compound channel with feedback
Optimal computation of symmetric Boolean functions in tree networks
Optimal incorporation of sparsity information by weighted ℓ1 optimization
Optimality and approximate optimality of source-channel separation in networks
Optimal multiresolution quantization for broadcast channels with random index assignment
Optimal ordering of transmissions for computing Boolean threshold functions
Partial zero-forcing precoding for the interference channel with partially cooperating transmitters
Performance analysis of identification system based on order statistics list decoder
Performance analysis of linear codes under maximum likelihood decoding at low rates
Polytope codes against adversaries in networks
Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrong
Refined rate of channel polarization
Regularization for matrix completion
Regularized blind detection for MIMO communications
Relay-aided Interference Alignment for the quasi-static interference channel
Rényi divergence and majorization
Rewritable storage channels with limited number of rewrite iterations
Robust beamforming for multi-cell downlink transmission
Robust lossy detection using sparse measurements: The regular case
Robust multiresolution coding with Hamming distortion measure
Sample complexity for 1-bit compressed sensing and sparse classification
Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels
Secure-broadcast codes over linear-deterministic channels
Secure computing
Secure distributive storage of decentralized source data: Can interaction help?
Security in distributed storage systems by communicating a logarithmic number of bits.
Self-organized spectrum sharing in large MIMO multiple-access channels
Shannon meets Tesla: Wireless information and power transfer
Small ensembles of sampling matrices constructed from coding theory
Stable Principal Component Pursuit
State-Dependent Relay Channel with Private Messages with Partial Causal and Non-Causal Channel State Information
Statistical mechanical analysis of a typical reconstruction limit of compressed sensing

« prev Page 3/4 next »