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...
Saved in:
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: | |
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 |
Similar Items
-
The worst-case norm of uncertain linear systems under inputs with magnitude bound and rate limit
by: Wathanyoo Khaisongkram
Published: (2011) -
The optimal value bounds of the objective function in the interval linear programming problem
by: M. Allahdadi", et al.
Published: (2019) -
Linear authentication codes: Bounds and constructions
by: Wang, H., et al.
Published: (2014) -
Combinatorial Lower Bounds for 3-Query LDCs
by: Bhattacharyya, Arnab, et al.
Published: (2020) -
Fuzzy linear programming: An application in portfolio selection
by: Lim, Erin Beatrice K., et al.
Published: (2008)