Routing and Network Coding on Lines, Stars, and Rings

Add to your list(s) Download to your calendar using vCal

• Gerhard Kramer, University of Southern California, Los Angeles
• Thursday 18 June 2009, 14:15-15:00
• LR5, Engineering, Department of.

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 Signal Processing and Communications Lab Seminars series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge University Engineering Department Talks
• Cambridge talks
• Centre for Smart Infrastructure & Construction
• Chris Davis' list
• Computational Continuum Mechanics Group Seminars
• Featured lists
• Information Engineering Division seminar list
• Interested Talks
• LR5, Engineering, Department of
• School of Technology
• Signal Processing and Communications Lab Seminars
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.