Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funders: Eesti Teadusagentuur, Tartu Ülikool
OpenAlex ID: W7160944912
Cites:
Cited by:
Related to: