On the Parameters of Codes for Data Access
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911939166208000 |
|---|---|
| author | Kilic, Altan B. Ravagnani, Alberto Soljanin, Emina |
| author_facet | Kilic, Altan B. Ravagnani, Alberto Soljanin, Emina |
| contents | This paper studies two crucial problems in the context of coded distributed storage systems directly related to their performance: 1) for a fixed alphabet size, determine the minimum number of servers the system must have for its service rate region to contain a prescribed set of points; 2) for a given number of servers, determine the minimum alphabet size for which the service rate region of the system contains a prescribed set of points. The paper establishes rigorous upper and lower bounds, as well as code constructions based on techniques from coding theory, optimization, and projective geometry. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_01229 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Parameters of Codes for Data Access Kilic, Altan B. Ravagnani, Alberto Soljanin, Emina Information Theory This paper studies two crucial problems in the context of coded distributed storage systems directly related to their performance: 1) for a fixed alphabet size, determine the minimum number of servers the system must have for its service rate region to contain a prescribed set of points; 2) for a given number of servers, determine the minimum alphabet size for which the service rate region of the system contains a prescribed set of points. The paper establishes rigorous upper and lower bounds, as well as code constructions based on techniques from coding theory, optimization, and projective geometry. |
| title | On the Parameters of Codes for Data Access |
| topic | Information Theory |
| url | https://arxiv.org/abs/2407.01229 |