Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming

Yeow Meng Chee, Han Mao Kiah, Hui Zhang 0004. Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming. In IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019. pages 2364-2368, IEEE, 2019. [doi]

@inproceedings{CheeK019,
  title = {Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming},
  author = {Yeow Meng Chee and Han Mao Kiah and Hui Zhang 0004},
  year = {2019},
  doi = {10.1109/ISIT.2019.8849477},
  url = {https://doi.org/10.1109/ISIT.2019.8849477},
  researchr = {https://researchr.org/publication/CheeK019},
  cites = {0},
  citedby = {0},
  pages = {2364-2368},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019},
  publisher = {IEEE},
  isbn = {978-1-5386-9291-2},
}