MaxMinSum Steiner Systems for Access Balancing in Distributed Storage

DOI10.1137/17M1143964zbMath1391.05053arXiv1708.04986OpenAlexW2745445621WikidataQ129516563 ScholiaQ129516563MaRDI QIDQ3174717

Hoang Dau, Olgica Milenković

Publication date: 18 July 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

block designsSteiner triple systemsdistributed storagefractional repetition codesaccess balanceBose/Skolem constructions

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Applications of design theory to circuits and networks (94C30) Triple systems (05B07)

Related Items (6)

Egalitarian Steiner quadruple systems of doubly even order ⋮ The spectrum of resolvable Bose triple systems ⋮ On the maximum double independence number of Steiner triple systems ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ Egalitarian Steiner triple systems for data popularity ⋮ Egalitarian edge orderings of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal Fractional Repetition Codes Based on Graphs and Designs
• On Quadruple Systems
• A Note on Steiner Triple Systems.
• Some Remarks on the Triple Systems of Steiner.
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• Combinatorial Designs
• Network Coding for Distributed Storage Systems
• Distributed Storage Allocations
• Optimal combinatorial batch codes based on block designs

This page was built for publication: MaxMinSum Steiner Systems for Access Balancing in Distributed Storage