2026/08/01 by Chenyang Yu, Luopeng Sun, Yiwei Zhang
Computer Science · Mathematics · #cs.IT #math.IT
6 pages, 3 figures, accepted by IEEE International Symposium on Information Theory 2026 (ISIT 2026)
arxiv created 2026/08/01 · arxiv updated 2026/08/04
The Service Rate Region (SRR) serves as a critical metric for evaluating the concurrent service capacity of distributed storage systems. While several works have characterized the SRR for MDS codes and first order Reed-Muller codes, for high-order Reed-Muller codes the problem becomes way more complicated and only partial results were given by Ly, Soljanin, and Lalitha [IEEE ISIT 2025]. In this paper, we refine the SRR analysis by explicitly characterizing the intersection patterns of recovery sets for high-order Reed-Muller codes, deriving the exact region for the case m=r+1 and providing new types of strictly tighter constraints to bridge the gap between existing approximations and the exact SRR polytope.