Weighted Euclidean superimposed codes for integer compressed sensing

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

Abstract

We introduce a new family of codes, termed weighted Euclidean superimposed codes (WESCs). This family generalizes the class of Euclidean superimposed codes, used in multiuser identification systems. WESCs allow for discriminating bounded, integer-valued linear combinations of real-valued codewords, and can therefore also be seen as a specialization of compressed sensing schemes. We present lower and upper bounds on the largest size of a member of the WESCs family, and show how to use classical coding-theoretic and new compressed sensing analytical tools to devise low-complexity decoding algorithms for these codes.

Original languageEnglish (US)
Title of host publication2008 IEEE Information Theory Workshop, ITW
Pages124-128
Number of pages5
DOIs
StatePublished - Sep 22 2008
Event2008 IEEE Information Theory Workshop, ITW - Porto, Portugal
Duration: May 5 2008May 9 2008

Publication series

Name2008 IEEE Information Theory Workshop, ITW

Other

Other2008 IEEE Information Theory Workshop, ITW
CountryPortugal
CityPorto
Period5/5/085/9/08

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

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

Cite this