TY - GEN
T1 - Weighted Euclidean superimposed codes for integer compressed sensing
AU - Dai, Wei
AU - Milenkovic, Olgica
PY - 2008/9/22
Y1 - 2008/9/22
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=51849139495&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51849139495&partnerID=8YFLogxK
U2 - 10.1109/ITW.2008.4578635
DO - 10.1109/ITW.2008.4578635
M3 - Conference contribution
AN - SCOPUS:51849139495
SN - 9781424422708
T3 - 2008 IEEE Information Theory Workshop, ITW
SP - 124
EP - 128
BT - 2008 IEEE Information Theory Workshop, ITW
T2 - 2008 IEEE Information Theory Workshop, ITW
Y2 - 5 May 2008 through 9 May 2008
ER -