University of Cambridge > Talks.cam > Probabilistic Systems, Information, and Inference Group Seminars > Routing and Network Coding on Lines, Stars, and Rings

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Routing and Network Coding on Lines, Stars, and Rings

Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Fogg .

Network coding allows each node in a network to combine its input information instead of simply storing, copying, and forwarding data. We present several recent results. The first is an upper bound on network coding rates that applies to wireline, wireless, and mixed wireline/wireless networks. The bound, called a progressive d- separating edge set (or PdE) bound, involves progressively removing edges from a network graph and checking whether certain strengthened d- separation conditions are satisfied. Second, we consider line networks that are elements of larger networks. We show that under both edge and node capacity constraints the optimal code is a combination of rate- splitting, copying, routing, and “butterfly” binary linear network coding. Third, we consider star and ring networks and develop related results.

This work was done jointly with Sadegh Tabatabaei and Serap A. Savari.

This talk is part of the Probabilistic Systems, Information, and Inference Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room U202, Department of Chemistry Cambridge University, Engineering Department ,Lecture Room 11 Battcock, F17

Other talks

Caribbean Trip and Cacti A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Title to be confirmed How Far Can Good Go Without God? The Limits of a Naturalistic Ethic Using numerical simulations for solving spectral geometry problems Morning Break
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity