2012/09/19 by Kumar Viswanatha, Viswanatha, Kumar, Emrah Akyol +3
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Advanced Data Compression Techniques #Cooperative Communication and Network Coding #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1209.4383
openalex publication_date 2012/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper considers the problem of minimum cost communication of correlated\nsources over a network with multiple sinks, which consists of distributed\nsource coding followed by routing. We introduce a new routing paradigm called\ndispersive information routing, wherein the intermediate nodes are allowed to\n`split' a packet and forward subsets of the received bits on each of the\nforward paths. This paradigm opens up a rich class of research problems which\nfocus on the interplay between encoding and routing in a network. Unlike\nconventional routing methods such as in [1], dispersive information routing\nensures that each sink receives just the information needed to reconstruct the\nsources it is required to reproduce. We demonstrate using simple examples that\nour approach offers better asymptotic performance than conventional routing\ntechniques. This paradigm leads to a new information theoretic setup, which has\nnot been studied earlier. We propose a new coding scheme, using principles from\nmultiple descriptions encoding [2] and Han and Kobayashi decoding [3]. We show\nthat this coding scheme achieves the complete rate region for certain special\ncases of the general setup and thereby achieves the minimum communication cost\nunder this routing paradigm.\n