Weighted Superimposed Codes and Constrained Integer Compressed Sensing

Details Weighted Superimposed Codes and Constrained Integer Compressed Sensing Weighted Superimposed Codes and Constrained Integer Compressed Sensing

2008-06-16

arxiv.org/abs/0806.2682v1

Computer Science

Information Theory

Submitted to IEEE Trans. on Information Theory

Scientific paper

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 non-negativity 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.

Affiliated with

Also associated with

No associations

Rating

Weighted Superimposed Codes and Constrained Integer Compressed Sensing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weighted Superimposed Codes and Constrained Integer Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted Superimposed Codes and Constrained Integer Compressed Sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-407969