BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Coded Cooperative Data Exchange Problem
DTSTART:20160708T133000
DTEND:20160708T153000
DTSTAMP:20260406T220101Z
UID:2e8307baeb76389d6472c8a9f55b4d68c5d20474d1f977ab2a610361
CATEGORIES:Conferences - Seminars
DESCRIPTION:Su Li\nEDIC Candidacy Exam\nExam President: Prof. Bixio Rimold
 i\nThesis Director: Prof. Michael Gastpar\nCo-examiner: Dr. Olivier Lévê
 que\nBackground papers:Linear Network Coding\, by S.R.Li\, R.W.Yeung and N
 .Cai. IEEE Transactions on Information Theory. 2003.Coded Cooperative Data
  Exchange in Multihop Networks\, by T.A.Courtade and R.D.Wesel. IEEE Trans
 actions on Information Theory. 2014.Estimating Minimum Sum-rate for Cooper
 ative Data Exchange\, by N.Ding\, R.A.Kennedy and P.Sadeghi. ISIT 2015.\nA
 bstract\nConsider a connected network composed of N nodes that want to rec
 over a common file. The file consists of K packets. Each node initially on
 ly possesses a subset of the total K packets and needs to obtain all the p
 ackets eventually. Assuming that every node is fully acquainted with the a
 vailable packet set of other nodes and the topology of the network\, we wa
 nt to answer how many transmissions are required to achieve the universal 
 recovery of all packets at all nodes and find the corresponding transmissi
 on schemes.
LOCATION:BC 02 https://plan.epfl.ch/?room==BC%2002
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR