Elements of information theory
Elements of information theory
Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information theory and statistics: a tutorial
Communications and Information Theory
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
On classification with empirically observed statistics and universal data compression
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Universal coding, information, prediction, and estimation
IEEE Transactions on Information Theory
A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The theory of Compressed Sensing (highly popular in recent years) has a close relative that was developed around thirty years earlier and has been almost forgotten since --- the design of screening experiments. For both problems, the main assumption is sparsity of active inputs, and the fundamental feature in both theories is the threshold phenomenon: reliable recovery of sparse active inputs is possible when the rate of design is less than the so-called capacity threshold, and impossible with higher rates. Another close relative of both theories is multi-access information transmission. We survey a collection of tight and almost tight screening capacity bounds for both adaptive and non-adaptive strategies which correspond to either having or not having feedback in information transmission. These bounds are inspired by results from multi-access capacity theory. We also compare these bounds with the simulated performance of two analysis methods: (i) linear programming relaxation methods akin to basis pursuit used in compressed sensing, and (ii) greedy methods of low complexity for both non-adaptive and adaptive strategies.