Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2509.22898 (cs)
[Submitted on 26 Sep 2025]

Title:The Service Rate Region of Hamming Codes

Authors:Priyanka Choudhary, Maheshanand Bhaintwal
View PDF HTML (experimental)
Abstract:The service rate region of a coded distributed storage system is the set of all achievable data access requests under the capacity constraints. This paper investigates the service rate regions of systematic Hamming codes using hypergraph theory and derives bounds for the maximal achievable service rate of individual data objects. We establish upper bounds on the sum of service rates of data symbols indexed by a subset of systematic nodes in a systematic binary Hamming code, and explore the achievability of these bounds. Additionally, for non-systematic binary Hamming codes, we conclude that the aggregate service rate is limited by the number of columns of odd weight in the associated generator matrix.
Subjects: Information Theory (cs.IT); Combinatorics (math.CO)
Cite as: arXiv:2509.22898 [cs.IT]
  (or arXiv:2509.22898v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2509.22898

Submission history

From: Priyanka Choudhary [view email]
[v1] Fri, 26 Sep 2025 20:25:49 UTC (26 KB)
Full-text links:

Access Paper:

view license

Current browse context:

cs.IT
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
math
math.CO
math.IT

References & Citations

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)