PreprintarXiv licencearXiv
Recovery Models for Linear Batch Codes
Abstract
Various types of recovery algorithms for batch codes have been considered previously, including asynchronous recovery and recovery algorithms arising from Almost Affinely Disjoint (AAD) families. We initiate a systematic investigation of linear batch codes equipped with recovery algorithms. We introduce online and strongly online batch codes, investigate their relations with asynchronous batch codes, and introduce (m,L)-strongly online batch codes, which provide particularly simple recovery algorithms. We then study simple batch codes associated with arbitrary bipartite graphs, obtaining graph-theoretic conditions for such codes and generalizing several known results.
Related
- Linear-time erasure recovery for quantum expander codes
- Linear Programming Bounds for Locally Recovery Codes II
- On randomized batch-sampling coordinate descent methods for solving linear least-squares problems
- Unbiased Gradients, Moving Stability Boundaries: Exact Mini-Batch Geometry in Linear Self-Attention
- Exact Recovery for Non-Abelian Surface Codes
BibTeX
@misc{duzgun2026recovery,
title = {{Recovery Models for Linear Batch Codes}},
author = {Baran Düzgün and Henk D. L. Hollmann and Ago-Erik Riet and Vitaly Skachek and Vladislav Taranchuk},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2605.09748},
eprint = {2605.09748},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.09748},
}
RIS
TY - UNPB
TI - Recovery Models for Linear Batch Codes
AU - Baran Düzgün
AU - Henk D. L. Hollmann
AU - Ago-Erik Riet
AU - Vitaly Skachek
AU - Vladislav Taranchuk
PY - 2026
DA - 2026/10/15
PB - arXiv
DO - 10.48550/arxiv.2605.09748
UR - https://arxiv.org/abs/2605.09748
AB - Various types of recovery algorithms for batch codes have been considered previously, including asynchronous recovery and recovery algorithms arising from Almost Affinely Disjoint (AAD) families. We initiate a systematic investigation of linear batch codes equipped with recovery algorithms. We introduce online and strongly online batch codes, investigate their relations with asynchronous batch codes, and introduce (m,L)-strongly online batch codes, which provide particularly simple recovery algorithms. We then study simple batch codes associated with arbitrary bipartite graphs, obtaining graph-theoretic conditions for such codes and generalizing several known results.
ER -