Bounding Transmission Rates in Broadcast Problems
Talk by Prof. Dr. Eimear Byrne
Date: 16.08.16 Time: 15.00 - 16.00 Room:
Broadcast with side-information is a problem that arises is a number of network coding contexts, including network coding and coded-caching. Such problems involve efficient delivery of big data files to many users, each of whom already has some data stored locally in its cache via some form of placement, either randomly or by design. In the case of linear coding, the structure of the cached data or side information can be expressed as a rank-metric code. The fundamental limits of transmission in these problems then relate to covering properties of certain classes of matrix codes. We will make this connection explicit and give some bounds using rank-metric covering methods.