Bounds for Batch Codes with Restricted Query Size
Hui Zhang, Vitaly Skachek
TL;DR
This paper establishes improved upper bounds for batch codes with limited query sizes, enhancing existing bounds by leveraging locality-based techniques and novel ideas specific to batch codes.
Contribution
It introduces tighter upper bounds for batch codes with restricted query size, advancing the theoretical understanding of their limitations.
Findings
New upper bounds improve upon the Singleton bound.
Techniques adapt locality ideas for batch code analysis.
Additional improvements are achieved through novel methods.
Abstract
We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for codes with locality. By employing additional ideas, we obtain further improvements, which are specific for batch codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Coding theory and cryptography · Cooperative Communication and Network Coding