Bounds on the Service Rates of Linear Codes and their Connections to Combinatorial Designs
Abstract
The service rate region of a distributed storage system describes the set of concurrent demand vectors that can be served without overloading any individual server, and is a fundamental measure of how effectively redundancy is used. In this paper, we investigate aggregate service rates in distributed data storage systems based on linear codes over arbitrary finite fields. We first derive an upper bound on the aggregate service rate for an arbitrary subset of t data objects in terms of the dual distance and the sizes of their smallest recovery sets. For systematic generator matrices, this bound simplifies to an expression depending only on the code length, the dual distance, and the cardinality of the selected subset. This result extends existing bounds and provides a subset-wise formulation of the First Dual Distance Bound. We then establish conditions under which this upper bound is attained. We apply our results to several important families of linear codes, including MDS codes, Reed-Muller codes, constacyclic codes, and extended Golay codes, and obtain exact values of the maximum aggregate service rates for the corresponding subsets of data objects.
Related
- Combinatorial bounds for the v-number of binomial edge ideals
- Infinite families of 3-designs from linear and nonlinear codes
- Linear bounds and sharp exponential growth for commuting matrix algebra
- The upper bounds on occupancy fraction and variance fraction for linear regular uniform hypergraphs
- Linear bounds for rich-neighbor edge-colorings
BibTeX
@misc{yadav2026bounds,
title = {{Bounds on the Service Rates of Linear Codes and their Connections to Combinatorial Designs}},
author = {Monika Yadav and Priyanka Choudhary and Maheshanand Bhaintwal},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.26683},
eprint = {2610.26683},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.26683},
}
RIS
TY - UNPB
TI - Bounds on the Service Rates of Linear Codes and their Connections to Combinatorial Designs
AU - Monika Yadav
AU - Priyanka Choudhary
AU - Maheshanand Bhaintwal
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.26683
UR - https://arxiv.org/abs/2610.26683
AB - The service rate region of a distributed storage system describes the set of concurrent demand vectors that can be served without overloading any individual server, and is a fundamental measure of how effectively redundancy is used. In this paper, we investigate aggregate service rates in distributed data storage systems based on linear codes over arbitrary finite fields. We first derive an upper bound on the aggregate service rate for an arbitrary subset of t data objects in terms of the dual distance and the sizes of their smallest recovery sets. For systematic generator matrices, this bound simplifies to an expression depending only on the code length, the dual distance, and the cardinality of the selected subset. This result extends existing bounds and provides a subset-wise formulation of the First Dual Distance Bound. We then establish conditions under which this upper bound is attained. We apply our results to several important families of linear codes, including MDS codes, Reed-Muller codes, constacyclic codes, and extended Golay codes, and obtain exact values of the maximum aggregate service rates for the corresponding subsets of data objects.
ER -