University of Michigan
EECS Department
Electrical and
Computer Engineering
EECS Building
1301 Beal Avenue
Ann Arbor, MI 481092122
Distinguished Lecture
Network Coding: from Graph Theory to Algebraic Geometry
Dr. Emina Soljanin
 
Thursday, January 22, 2004
4:00pm  5:30pm 1500 EECS


About the EventThe famous mincut, maxflow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the mincut separating the source and the sink. Recently it has been shown that by linear reencoding at nodes in communications networks, the mincut rate can be also achieved in multicasting to several sinks. Constructing such coding schemes efficiently is the subject of current research. Our idea was to divide the network coding problem into two almost independent problems: one of graph theory and the other of classical channel coding theory and algebraic geometry. This talk will describe our approach to the network coding problem and its strengths in deriving theoretical results and practical codes. 
Additional Information
Contact: Kim A. Winick
Email: winick@umich.edu
Sponsor: Lucent Technologies/EECS500
Open to: Public


