Weighted superimposed codes and constrained integer compressed sensing

Authors:
Wei Dai;Olgica Milenkovic
Affiliations:
Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 9
Cited 4

What's hot and what's not: tracking most frequent items dynamically

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Explicit Non-adaptive Combinatorial Group Testing Schemes

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Probe Design for Compressive Sensing DNA Microarrays

BIBM '08 Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine
An improved upper bound of the rate of Euclidean superimposed codes

IEEE Transactions on Information Theory
Greed is good: algorithmic results for sparse approximation

IEEE Transactions on Information Theory
Decoding by linear programming

IEEE Transactions on Information Theory
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

IEEE Transactions on Information Theory

Performance bounds on compressed sensing with Poisson noise

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Compressed sensing performance bounds under Poisson noise

IEEE Transactions on Signal Processing
Fighting censorship with algorithms

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Distributed sensor failure detection in sensor networks

Signal Processing

Quantified Score

Hi-index	754.84

Visualization

Abstract

We introduce a new family of codes, termed weighted superimposed codes (WSCs). This family generalizes the class of Euclidean superimposed codes (ESCs), used in multiuser identification systems. WSCs allow for discriminating all bounded, integer-valued linear combinations of real-valued codewords that satisfy prescribed norm and nonnegativity constraints. By design, WSCs are inherently noise tolerant. Therefore, these codes can be seen as special instances of robust compressed sensing schemes. The main results of the paper are lower and upper bounds on the largest achievable code rates of several classes of WSCs. These bounds suggest that, with the codeword and weighting vector constraints at hand, one can improve the code rates achievable by standard compressive sensing techniques.