Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.07835 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908446199119872 |
|---|---|
| author | Baghban, Akram Newman, Marc Horlemann, Anna-Lena Ghiyasvand, Mehdi |
| author_facet | Baghban, Akram Newman, Marc Horlemann, Anna-Lena Ghiyasvand, Mehdi |
| contents | This work focuses on sequential locally recoverable codes (SLRCs), a special family of locally repairable codes, capable of correcting multiple code symbol erasures, which are commonly used for distributed storage systems. First, we construct an extended $q$-ary family of non-binary SLRCs using code products with a novel maximum number of recoverable erasures $t$ and a minimal repair alternativity $A$. Second, we study how MDS and BCH codes can be used to construct $q$-ary SLRCs. Finally, we compare our codes to other LRCs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_07835 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | $q$-ary Sequential Locally Recoverable Codes from the Product Construction Baghban, Akram Newman, Marc Horlemann, Anna-Lena Ghiyasvand, Mehdi Information Theory This work focuses on sequential locally recoverable codes (SLRCs), a special family of locally repairable codes, capable of correcting multiple code symbol erasures, which are commonly used for distributed storage systems. First, we construct an extended $q$-ary family of non-binary SLRCs using code products with a novel maximum number of recoverable erasures $t$ and a minimal repair alternativity $A$. Second, we study how MDS and BCH codes can be used to construct $q$-ary SLRCs. Finally, we compare our codes to other LRCs. |
| title | $q$-ary Sequential Locally Recoverable Codes from the Product Construction |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.07835 |