Record Details

Real slepian-wolf codes

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Real slepian-wolf codes
 
Creator SHENVI, S
DEY, BK
JAGGI, S
LANGBERG, M
 
Subject codes (standards)
cybernetics
integer programming
decoding
 
Description 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.
 
Publisher IEEE
 
Date 2008-12-23T06:44:50Z
2011-11-28T03:36:21Z
2011-12-15T09:56:17Z
2008-12-23T06:44:50Z
2011-11-28T03:36:21Z
2011-12-15T09:56:17Z
2008
 
Type Article
 
Identifier Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, 6-11 July 2008, 1423-1427
978-1-4244-2256-2
10.1109/ISIT.2008.4595222
http://hdl.handle.net/10054/471
http://dspace.library.iitb.ac.in/xmlui/handle/10054/471
 
Language en