Relaxations of Hall's condition: optimal batch codes with multiple queries

DOI10.2298/AADM111130024BMaRDI QIDQ5396539zbMATH OpenWikidataFDO

Authors Csilla Bujtás, Zsolt Tuza

Publication date 7 February 2014

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/AADM111130024B

zbMATH Keywords

combinatorial batch codedual systemHall-type conditionsystem of representatives

Mathematics Subject Classification ID

Extremal set theory (05D05) Database theory (68P15) Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Combinatorial batch codes
• Optimal batch codes: many items or low retrieval requirement
• Multiset combinatorial batch codes
• Optimal combinatorial batch codes derived from dual systems
• A survey of the study of combinatorial batch code

Cited in

(12)

• On erasure combinatorial batch codes
• Multiset combinatorial batch codes
• Combinatorial batch codes
• Turán numbers and batch codes
• Combinatorial batch codes: extremal problems under Hall-type conditions
• Derandomized construction of combinatorial batch codes
• A survey of the study of combinatorial batch code
• Linear batch codes
• Optimal combinatorial batch codes based on block designs
• Bounds on data limits for all-to-all comparison from combinatorial designs
• On an extremal hypergraph problem related to combinatorial batch codes
• Construction of extended Steiner systems for information retrieval

This page was built for publication: Relaxations of Hall's condition: optimal batch codes with multiple queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396539)