Defines all-symbol PIR and batch codes, determines minimal lengths for small k and t, characterizes optimal codes, and proves new cases of the simplex code conjecture on functional batch recovery.
Lower bounds on the redundancy of linear codes with disjoint repair groups,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Serving Every Symbol: All-Symbol PIR and Batch Codes
Defines all-symbol PIR and batch codes, determines minimal lengths for small k and t, characterizes optimal codes, and proves new cases of the simplex code conjecture on functional batch recovery.