Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming
Authors:
- 1 July 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2364-2368
Abstract
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs). MCBCs allow multiple users to retrieve items in parallel in a distributed storage system and a fundamental objective in this study is to determine the minimum total storage given certain requirements.We formulate an integer linear programming problem so that its optimal solution provides a lower bound of the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases and also, determine the exact values for some parameters.Keywords
This publication has 8 references indexed in Scilit:
- Multiset combinatorial batch codesDesigns, Codes and Cryptography, 2018
- On an extremal hypergraph problem related to combinatorial batch codesDiscrete Applied Mathematics, 2014
- Combinatorial batch codes: A lower bound and optimal constructionsAdvances in Mathematics of Communications, 2012
- Optimal batch codes: Many items or low retrieval requirementAdvances in Mathematics of Communications, 2011
- Optimal combinatorial batch codes derived from dual systemsMiskolc Mathematical Notes, 2011
- Combinatorial batch codes and transversal matroidsAdvances in Mathematics of Communications, 2010
- Combinatorial batch codesAdvances in Mathematics of Communications, 2009
- Batch codes and their applications2004