TY - GEN
T1 - "Real" Slepian-Wolf codes
AU - Shenvi, S.
AU - Dey, B. K.
AU - Jaggi, S.
AU - Langberg, M.
PY - 2008
Y1 - 2008
N2 - We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class of information theory problems, and for the field of compressed sensing.
AB - We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class of information theory problems, and for the field of compressed sensing.
UR - https://www.scopus.com/pages/publications/52349122163
U2 - 10.1109/ISIT.2008.4595222
DO - 10.1109/ISIT.2008.4595222
M3 - Conference contribution
AN - SCOPUS:52349122163
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1423
EP - 1427
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -