Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated just now
PreprintarXiv licencearXiv

Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction

  • Priyanka Choudhary
  • Maheshanand Bhaintwal
Open at sourcePDFDOICite

Abstract

In distributed storage systems, redundancy enables a single data object to be reconstructed using several disjoint groups of servers. The resulting service rate region (SRR) captures all combinations of object request rates that the system can support simultaneously without overloading any individual server. We analyze the SRR of binary codes obtained via the Plotkin-type construction. We demonstrate that each recovery set for an information object of the Plotkin-type code π’žp induces a corresponding recovery set for the same data object characterized by the underlying code π’ž. Furthermore, by characterizing the recovery sets structure of π’žp in terms of the recovery set structure of π’ž, we identify the additional recovery sets introduced by this construction. Using the associated recovery hypergraphs, we establish bounds on the SRRs of π’žp and iterated code π’žpm in terms of the SRR of π’ž. We consider the family of first-order binary Reed-Muller codes and show how the recovery structure, and consequently, the service rates of R(1,m) for arbitrary m can be recursively derived from a generator matrix of R(1,2) through our results for successive Plotkin-type constructions.

Related

  1. Two-step nilpotent Lie algebras obtained by quivers and geometric structures
    Fumika Mizoguchi
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  2. THE EGUCHI CONSTRUCTION ARISES FROM BI-LAGRANGIAN STRUCTURES
    Emmanuel Gnandi, StΓ©phane Puechmorel
    HALPreprintCC BY-SA 4.0Full textGeometry & topologyHALarXiv
  3. AKSZ Construction for Shifted Contact Structures
    Efe Δ°zbudak, Kadri Δ°lker Berktav
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryGeometry & topologyarXiv
  4. Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
    K. Hareesh, Rashid Ummer N. T., Balaji Sundar Rajan
    IEEE Transactions on Information TheoryPeer-reviewedLicence not statedFull text10 citedCombinatorics & discrete mathematicsOpenAlex
  5. Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings
    Kanchana Lokshmii Jagatti, B. Sundar Rajan
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{choudhary2026recovery,
  title = {{Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction}},
  author = {Priyanka Choudhary and Maheshanand Bhaintwal},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.01900},
  eprint = {2610.01900},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.01900},
}
RIS
TY  - UNPB
TI  - Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction
AU  - Priyanka Choudhary
AU  - Maheshanand Bhaintwal
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2610.01900
UR  - https://arxiv.org/abs/2610.01900
AB  - In distributed storage systems, redundancy enables a single data object to be reconstructed using several disjoint groups of servers. The resulting service rate region (SRR) captures all combinations of object request rates that the system can support simultaneously without overloading any individual server. We analyze the SRR of binary codes obtained via the Plotkin-type construction. We demonstrate that each recovery set for an information object of the Plotkin-type code π’ž_p induces a corresponding recovery set for the same data object characterized by the underlying code π’ž. Furthermore, by characterizing the recovery sets structure of π’ž_p in terms of the recovery set structure of π’ž, we identify the additional recovery sets introduced by this construction. Using the associated recovery hypergraphs, we establish bounds on the SRRs of π’ž_p and iterated code π’ž_p^m in terms of the SRR of π’ž. We consider the family of first-order binary Reed-Muller codes and show how the recovery structure, and consequently, the service rates of R(1,m) for arbitrary m can be recursively derived from a generator matrix of R(1,2) through our results for successive Plotkin-type constructions.
ER  -