2008/10/08 by Bikash Kumar Dey, Sidharth Jaggi, Dey, Bikash Kumar +3
Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.0810.1424
openalex publication_date 2008/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 typicality decoding is equivalent to solving an integer program. Minimum entropy decoding is also shown to achieve exponentially small probability of error. 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.