BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Routing and Network Coding on Lines\, Stars\, and Rings - Gerhard 
 Kramer\, University of Southern California\, Los Angeles
DTSTART:20090618T131500Z
DTEND:20090618T140000Z
UID:TALK18787@talks.cam.ac.uk
CONTACT:Rachel Fogg
DESCRIPTION:Network coding allows each node in a network to combine its in
 put information instead of simply storing\, copying\, and forwarding data.
   \nWe present several recent results. The first is an upper bound on netw
 ork 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 gra
 ph 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 o
 ptimal code is a combination of rate- splitting\, copying\, routing\, and 
 "butterfly" binary linear network coding. Third\, we consider star and rin
 g networks and develop related results.\n\nThis work was done jointly with
  Sadegh Tabatabaei and Serap A. Savari.
LOCATION:LR5\, Engineering\, Department of
END:VEVENT
END:VCALENDAR