Relaxations of Hall’s Condition: Optimal batch codes with multiple queries

Author:

Bujtás Csilla1,Tuza Zsolt2

Affiliation:

1. University of Pannonia, Department of Computer Science and Systems Technology, Veszprem, Hungary

2. Hungarian Academy of Sciences, Computer and Automation Institute, Budapest, Hungary

Abstract

Combinatorial batch codes model the storage of a database on a given number of servers such that any k or fewer items can be retrieved by reading at most t items from each server. A combinatorial batch code with parameters n; k; m; t can be represented by a system F of n (not necessarily distinct) sets over an m-element underlying set X, such that for any k or fewer members of F there exists a system of representatives in which each element of X occurs with multiplicity at most t. The main purpose is to determine the minimum N(n; k; m; t) of total data storage ?F?F |F| over all combinatorial batch codes F with given parameters. Previous papers concentrated on the case t = 1. Here we obtain the first nontrivial results on combinatorial batch codes with t > 1. We determine N(n; k; m; t) for all cases with k ? 3t, and also for all cases where n ? t? m dk=te?2?. Our results can be considered equivalently as minimum total size ?F?F |F| over all set systems F of given order m and size n, which satisfy a relaxed version of Hall's Condition; that is, |UF?| ? |F?|/t holds for every subsystem F? ? F of size at most k.

Publisher

National Library of Serbia

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. New Results on Erasure Combinatorial Batch Codes;2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2023-09-26

2. Regular Multiset Combinatorial Batch Codes over Vector Spaces;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12

3. Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming;IEEE Transactions on Information Theory;2021-01

4. Nearly Optimal Constructions of PIR and Batch Codes;IEEE Transactions on Information Theory;2019-02

5. Consecutive Switch Codes;IEEE Transactions on Information Theory;2018-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3