Recovery Algorithms for Linear Batch Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917479518830592 |
|---|---|
| author | Düzgün, Baran Hollmann, Henk D. L. Riet, Ago-Erik Skachek, Vitaly Taranchuk, Vladislav |
| author_facet | Düzgün, Baran Hollmann, Henk D. L. Riet, Ago-Erik Skachek, Vitaly Taranchuk, Vladislav |
| contents | Various types of recovery algorithms for batch codes have been investigated, such as asynchronous recovery or recovery as afforded by batch codes obtained from Almost Affinely Disjoint (AAD) families. In this paper, we offer the first systematic investigation of linear batch codes equipped with particular recovery algorithms. We introduce and investigate various known and new types of algorithms, and we investigate the order hierarchy of these types of batch codes. The simplest known recovery algorithms are those associated with graph-based batch codes. We investigate the resulting batch codes for arbitrary bipartite graphs, thereby generalizing some known results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_09748 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Recovery Algorithms for Linear Batch Codes Düzgün, Baran Hollmann, Henk D. L. Riet, Ago-Erik Skachek, Vitaly Taranchuk, Vladislav Information Theory 68R05, 68R10 Various types of recovery algorithms for batch codes have been investigated, such as asynchronous recovery or recovery as afforded by batch codes obtained from Almost Affinely Disjoint (AAD) families. In this paper, we offer the first systematic investigation of linear batch codes equipped with particular recovery algorithms. We introduce and investigate various known and new types of algorithms, and we investigate the order hierarchy of these types of batch codes. The simplest known recovery algorithms are those associated with graph-based batch codes. We investigate the resulting batch codes for arbitrary bipartite graphs, thereby generalizing some known results. |
| title | Recovery Algorithms for Linear Batch Codes |
| topic | Information Theory 68R05, 68R10 |
| url | https://arxiv.org/abs/2605.09748 |