Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/146391
Title: Lower bounds for total storage of multiset combinatorial batch codes using linear programming
Authors: Chee, Yeow Meng
Kiah, Han Mao
Zhang, Hui
Keywords: Engineering::Computer science and engineering
Issue Date: 2019
Source: Chee, Y. M., Kiah, H. M., & Zhang, H. (2019). Lower bounds for total storage of multiset combinatorial batch codes using linear programming. Proceedings of the IEEE International Symposium on Information Theory (ISIT), 2364-2368. doi: 10.1109/ISIT.2019.8849477
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.
URI: https://hdl.handle.net/10356/146391
ISBN: 9781538692912
DOI: 10.1109/ISIT.2019.8849477
Rights: © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/ISIT.2019.8849477
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:NTC Conference Papers

Page view(s)

151
Updated on May 27, 2022

Download(s) 50

25
Updated on May 27, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.