On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915158322839552 |
|---|---|
| author | Yu, Wenjun Yuan, Bo-Jun Schwartz, Moshe |
| author_facet | Yu, Wenjun Yuan, Bo-Jun Schwartz, Moshe |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_12897 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs Yu, Wenjun Yuan, Bo-Jun Schwartz, Moshe Information Theory Combinatorics 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. |
| title | On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2502.12897 |