May 3 - Kelly Hall 310
8:30 - 9:30
Coding Theory and Pooled Testing for COVID-19
Kathryn Haymaker
9:30 - 10:30
Hermitian-Lifted Codes
Beth Malmskog
10:30 - 11:00
Fractional Decoding of Reed-Solomon Codes and some Relatives
Welington Santos
11:00 - 12:00
Service Rate Rates of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
Emina Soljanin
The service rate region of a code is a performance metric of a distributed system that stores data redundantly using the code. It measures the system's ability to serve multiple users requesting (different) data objects simultaneously. The service rate region of an [n,k] code is a convex polytope in the k-dimensional real vector space. We first show that this polytope is a linear map image of the fractional matching polytope of a certain hypergraph defined by the code generator matrix. We then focus on a large class of MDS codes whose associated hypergraphs are quasi-uniform and characterize their service rate regions by finding perfect matchings on the quasi-uniform hypergraphs.
12:00 - 12:30
Lunch
12:30 - 13:00
Linear Exact Repair Schemes
Daniel Valvo
13:00 - 14:00
Properties of the Direct Sum of q-Matroids
Heide Gluesing-Luerssen
14:00 - 14:30
Polar Coding and Wiretap Channels
Stephen Timmel
May 5 - McBryde Hall 455
16:00 - 17:00
Data Storage Systems and the Service Rate Region Polytope
Alberto Ravagnani
Being able to store and retrieve data efficiently will be a major society and technology challenge of the next decade. In distributed data storage, information is stored across several servers with redundancy, in such a way that it can be accessed by various users simultaneously. The set of access requests that a distributed data storage system can support is described by a polytope, called the service rate region of the system. This talk offers an introduction to the service rate problem, mainly focusing on the geometric properties of the service rate region polytope and their applications to information technology.