Sparse weighted Euclidean superimposed coding for integer compressed sensing

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We address the problem of bounding the achievable rates of a new class of superimposed codes, termed weighted Euclidean superimposed codes (WESCs). WESCs generalize traditional Euclidean superimposed codes in so far that they allow for distinguishing bounded, integer-valued linear combinations of codewords. They can also be viewed as a bridge between superimposed coding and compressive sensing. In particular, we focus on sparse WESCs, for which one can devise low-complexity decoding algorithms and simple analytical constructions. Our results include a sufficient condition for meeting a minimum distance requirement of sparse WESCs, and a lower bound on the largest rate of sparse WESCs. Also included is a simple extension of DeVore's deterministic construction for sparse compressed sensing matrices that meets the derived lower bound.

Original languageEnglish (US)
Title of host publicationCISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages470-475
Number of pages6
DOIs
StatePublished - Sep 22 2008
EventCISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States
Duration: Mar 19 2008Mar 21 2008

Publication series

NameCISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Other

OtherCISS 2008, 42nd Annual Conference on Information Sciences and Systems
CountryUnited States
CityPrinceton, NJ
Period3/19/083/21/08

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Sparse weighted Euclidean superimposed coding for integer compressed sensing'. Together they form a unique fingerprint.

Cite this