More on Combinatorial Batch Codes
Sushmita Ruj, Bimal Roy
TL;DR
This paper advances the study of combinatorial batch codes by addressing open questions and extending results to the case where t>1, building on foundational work by Paterson, Stinson, Wei, and others.
Contribution
It provides new insights and results for combinatorial batch codes in the general case t>1, answering previously open questions.
Findings
Extended results for t>1 in combinatorial batch codes
Answered open questions from prior research
Contributed to the theoretical understanding of batch codes
Abstract
Paterson, Stinson and Wei \cite{PSW} introduced Combinatorial batch codes, which are combinatorial description of Batch code. Batch codes were first presented by Ishai, Kushilevita, Ostrovsky and Sahai \cite{IKOS} in STOC'04. In this paper we answer some of the questions put forward by Paterson, Stinson and Wei and give some results for the general case which were not studied by the authors.
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
TopicsAdvanced Data Storage Technologies · DNA and Biological Computing · Advanced biosensing and bioanalysis techniques