Lower bounds for total storage of multiset combinatorial batch codes using linear programming

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 th...

Full description

Saved in:

Bibliographic Details
Main Authors:	Chee, Yeow Meng, Kiah, Han Mao, Zhang, Hui
Other Authors:	School of Physical and Mathematical Sciences
Format:	Conference or Workshop Item
Language:	English
Published:	2021
Subjects:	Engineering::Computer science and engineering Linear Programming Servers
Online Access:	https://hdl.handle.net/10356/146391
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University
Language:	English

id	sg-ntu-dr.10356-146391
record_format	dspace
spelling	sg-ntu-dr.10356-1463912022-07-22T08:23:01Z Lower bounds for total storage of multiset combinatorial batch codes using linear programming Chee, Yeow Meng Kiah, Han Mao Zhang, Hui School of Physical and Mathematical Sciences IEEE International Symposium on Information Theory (ISIT) Strategic Centre for Research in Privacy-Preserving Technologies & Systems Research Techno Plaza Engineering::Computer science and engineering Linear Programming Servers 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. Info-communications Media Development Authority (IMDA) National Research Foundation (NRF) Accepted version The authors would like to express their gratitude to the Associate Editor and the two anonymous reviewers for their constructive comments and suggestions which significantly improve the presentation of this work. This research of Han Mao Kiah is supported by the National Research Foundation, Singapore under its Strategic Capability Research Centres Funding Initiative. H. Zhang is supported by Singapore National Research Foundation grant NRF-RSS2016-004. 2021-02-16T01:19:38Z 2021-02-16T01:19:38Z 2019 Conference Paper 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 9781538692912 https://hdl.handle.net/10356/146391 10.1109/ISIT.2019.8849477 2-s2.0-85073146167 2364 2368 en © 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 application/pdf
institution	Nanyang Technological University
building	NTU Library
continent	Asia
country	Singapore Singapore
content_provider	NTU Library
collection	DR-NTU
language	English
topic	Engineering::Computer science and engineering Linear Programming Servers
spellingShingle	Engineering::Computer science and engineering Linear Programming Servers Chee, Yeow Meng Kiah, Han Mao Zhang, Hui Lower bounds for total storage of multiset combinatorial batch codes using linear programming
description	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.
author2	School of Physical and Mathematical Sciences
author_facet	School of Physical and Mathematical Sciences Chee, Yeow Meng Kiah, Han Mao Zhang, Hui
format	Conference or Workshop Item
author	Chee, Yeow Meng Kiah, Han Mao Zhang, Hui
author_sort	Chee, Yeow Meng
title	Lower bounds for total storage of multiset combinatorial batch codes using linear programming
title_short	Lower bounds for total storage of multiset combinatorial batch codes using linear programming
title_full	Lower bounds for total storage of multiset combinatorial batch codes using linear programming
title_fullStr	Lower bounds for total storage of multiset combinatorial batch codes using linear programming
title_full_unstemmed	Lower bounds for total storage of multiset combinatorial batch codes using linear programming
title_sort	lower bounds for total storage of multiset combinatorial batch codes using linear programming
publishDate	2021
url	https://hdl.handle.net/10356/146391
_version_	1739837431409016832

Lower bounds for total storage of multiset combinatorial batch codes using linear programming

Similar Items