XPost: cs.bboard, columbia.general.bboard 
  
 MIME-Version: 1.0 
 Content-Type: text/plain; 
  charset="iso-8859-1" 
 Return-Path:  
 Received: from ponyexpress.ee.columbia.edu (ponyexpress.ee.columbia.edu 
 [128.59.64.61]) 
  by marionberry.cc.columbia.edu (8.12.11/8.12.11) with ESMTP id 
 i1GGEwq6001537 
  (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NOT); 
  Mon, 16 Feb 2004 11:14:59 -0500 (EST) 
 Received: from Princeton (wangx.ee.columbia.edu [128.59.66.177]) 
  (authenticated bits=0) 
  by ponyexpress.ee.columbia.edu (8.12.8/8.12.8) with ESMTP id 
 i1GGErwo013079; 
  Mon, 16 Feb 2004 11:14:53 -0500 
 Message-ID: <007501c3f4a8$1ff55240$b1423b80@Princeton> 
 References: <002901c3f243$aa16fdf0$9e433b80@comet.columbia.edu> 
 X-Priority: 3 
 X-MSMail-Priority: Normal 
 X-Mailer: Microsoft Outlook Express 6.00.2720.3000 
 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2727.1300 
 X-Spam-Score: 0 () 
 X-Scanned-By: MIMEDefang 2.35 
 From: "Xiaodong Wang"  
 To: , , 
         , , 
         , , 
          
 Subject: Semina: Network coding - a combinatorial approach by Emina Soljanin 
 Date: Mon, 16 Feb 2004 11:15:42 -0500 
  
 Wednesday February 18, 2:00-3:00pm 
 Interschool Lab, 7th floor, Schapiro CEPSR 
  
 "Network Coding: A Combinatorial Approach" 
 by Dr. Emina Soljanin, Bell Labs 
  
 Abstract: The famous min-cut, max-flow 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 min-cut separating the source and the sink. Recently it has been 
 shown that 
 by linear re-encoding at nodes in communications networks, the min-cut 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. 
  
  
 Biography: Emina Soljanin received the M.S. and Ph.D. degrees in Electrical 
 Engineering from Texas A&M University, College Station, in 1989 and 1994, 
 and the European Diploma degree in Electrical Engineering from University of 
 Sarajevo, Bosnia, in 1986. She joined Bell Laboratories, Murray Hill, NJ, in 
 1994, as a member of Technical Staff in the Mathematical Sciences Research 
 Center. Her research interests are in the broad area of communications, 
 information and coding theory, their applications to storage systems, and 
 more recently quantum information theory. 
  
 Dr. Soljanin was the recipient of the 1992 Texas A&M University Electrical 
 Engineering Department Fouraker fellowship. She served as a Technical 
 Proof-Reader, 1990-1992, and as the Associate Editor for Coding Techniques, 
 1997-2000, for the IEEE Transactions on Information Theory. She has been 
 serving as a Co-Chair for the DIMACS Special Focus on Computational 
 Information Theory and Coding. 
  
 --- SoupGate-Win32 v1.05 
  * Origin: you cannot sedate... all the things you hate (1:229/2)