Coded Cooperative Data Exchange Problem

Thumbnail

Event details

Date 08.07.2016
Hour 13:3015:30
Speaker Su Li
Location
Category Conferences - Seminars
EDIC Candidacy Exam
Exam President: Prof. Bixio Rimoldi
Thesis Director: Prof. Michael Gastpar
Co-examiner: Dr. Olivier Lévêque

Background 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 Transactions on Information Theory. 2014.
Estimating Minimum Sum-rate for Cooperative Data Exchange, by N.Ding, R.A.Kennedy and P.Sadeghi. ISIT 2015.

Abstract
Consider a connected network composed of N nodes that want to recover a common file. The file consists of K packets. Each node initially only possesses a subset of the total K packets and needs to obtain all the packets eventually. Assuming that every node is fully acquainted with the available packet set of other nodes and the topology of the network, we want to answer how many transmissions are required to achieve the universal recovery of all packets at all nodes and find the corresponding transmission schemes.

Practical information

  • General public
  • Free

Contact

  • Cecilia Chapuis EDIC

Tags

EDIC candidacy exam

Share