Service Rates Of Mds Codes & Fractional Matchings In Quasi-Uniform Hypergraphs
2Emina Soljanin (Rutgers University)
https://simons.berkeley.edu/talks/emina-soljanin-rutgers-university-2024-03-08
Application-Driven Coding Theory
The service rate region of an [n,k] 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 a code is a polytope in the k-dimensional real space. We first show that this polytope is a linear map image of the fractional matching polytope of a hypergraph specified 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.