English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper considers the problem of minimum cost communication of correlatedsources over a network with multiple sinks, which consists of distributedsource coding followed by routing. We introduce a new routing paradigm calleddispersive information routing, wherein the intermediate nodes are allowed to`split' a packet and forward subsets of the received bits on each of theforward paths. This paradigm opens up a rich class of research problems whichfocus on the interplay between encoding and routing in a network. Unlikeconventional routing methods such as in [1], dispersive information routingensures that each sink receives just the information needed to reconstruct thesources it is required to reproduce. We demonstrate using simple examples thatour approach offers better asymptotic performance than conventional routingtechniques. This paradigm leads to a new information theoretic setup, which hasnot been studied earlier. We propose a new coding scheme, using principles frommultiple descriptions encoding [2] and Han and Kobayashi decoding [3]. We showthat this coding scheme achieves the complete rate region for certain specialcases of the general setup and thereby achieves the minimum communication costunder this routing paradigm.

Minimum Communication Cost for Joint Distributed Source Coding and Dispersive Information Routing