Access balancing in storage systems by labeling partial Steiner systems

DOI10.1007/s10623-020-00786-zzbMath1457.05014arXiv1906.12073OpenAlexW3049511237MaRDI QIDQ2205889

Ryan Gabrys, Olgica Milenković, Dylan Lusi, Charles J. Colbourn, Yeow Meng Chee, Hoang Dau, Alan C. H. Ling

Publication date: 21 October 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.12073

zbMATH Keywords

Steiner triple systemSteiner systemindependent setaccess balancing

Mathematics Subject Classification ID

Other types of codes (94B60) Triple systems (05B07) Information storage and retrieval of data (68P20) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Egalitarian Steiner quadruple systems of doubly even order ⋮ The spectrum of resolvable Bose triple systems ⋮ Egalitarian Steiner triple systems for data popularity ⋮ Egalitarian edge orderings of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of disjoint Steiner triple systems
• 2-chromatic Steiner quadruple systems
• Extremal uncrowded hypergraphs
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
• Some mappings of periodic groups
• The minimum independence number for designs
• Covering all triples on n marks by disjoint Steiner systems
• A construction for 2-chromatic Steiner quadruple systems
• Turan's theorem for \(k\)-graphs
• On the chromatic number of set systems
• Optimal Fractional Repetition Codes Based on Graphs and Designs
• MaxMinSum Steiner Systems for Access Balancing in Distributed Storage
• A Note on Steiner Triple Systems.
• Some Remarks on the Triple Systems of Steiner.
• The Algorithmic Aspects of Uncrowded Hypergraphs
• Note on independent sets in steiner systems
• Steiner Triple Systems with High Chromatic Index
• On uncrowded hypergraphs
• Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
• On the Independence Number of Steiner Systems
• On independent sets in hypergraphs
• On chromatic number of graphs and set-systems
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• Colouring Steiner quadruple systems
• Optimal combinatorial batch codes based on block designs

This page was built for publication: Access balancing in storage systems by labeling partial Steiner systems