On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs

Wenjun Yu; Bo Jun Yuan; Moshe Schwartz

doi:10.1109/TIT.2026.3665157

On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs

Wenjun Yu
, Bo Jun Yuan
, Moshe Schwartz

Research output: Contribution to journal › Article › peer-review

Abstract

We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.

Original language	English
Pages (from-to)	2123-2132
Number of pages	10
Journal	IEEE Transactions on Information Theory
Volume	72
Issue number	4
DOIs	https://doi.org/10.1109/TIT.2026.3665157
State	Published - 1 Jan 2026

Keywords

Error-correcting codes
covering designs
fractional repetition codes

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2026.3665157

Cite this

@article{1df331700fcc4a57a9b627c064a620c4,

title = "On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs",

abstract = "We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.",

keywords = "Error-correcting codes, covering designs, fractional repetition codes",

author = "Wenjun Yu and Yuan, \{Bo Jun\} and Moshe Schwartz",

note = "Publisher Copyright: {\textcopyright} 2026 IEEE.",

year = "2026",

month = jan,

day = "1",

doi = "10.1109/TIT.2026.3665157",

language = "English",

volume = "72",

pages = "2123--2132",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "4",

}

TY - JOUR

T1 - On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs

AU - Yu, Wenjun

AU - Yuan, Bo Jun

AU - Schwartz, Moshe

PY - 2026/1/1

Y1 - 2026/1/1

N2 - We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.

AB - We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a price of an expansion factor compared with the optimal size of fractional repetition codes based on Steiner systems. We provide three constructions, as well as show non-constructively, that no expansion is needed for all codes based on sufficiently large covering systems.

KW - Error-correcting codes

KW - covering designs

KW - fractional repetition codes

UR - https://www.scopus.com/pages/publications/105030819975

U2 - 10.1109/TIT.2026.3665157

DO - 10.1109/TIT.2026.3665157

M3 - Article

AN - SCOPUS:105030819975

SN - 0018-9448

VL - 72

SP - 2123

EP - 2132

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 4

ER -

On Zero Skip-Cost Generalized Fractional-Repetition Codes From Covering Designs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this