Egalitarian Steiner triple systems for data popularity
From MaRDI portal
Publication:2232127
DOI10.1007/s10623-021-00925-0zbMath1473.05034OpenAlexW3200915105MaRDI QIDQ2232127
Publication date: 4 October 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00925-0
Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10) Mathematical problems of computer architecture (68M07) Triple systems (05B07) Information storage and retrieval of data (68P20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordering block designs. Gray codes, universal cycles and configuration orderings
- Affine-invariant strictly cyclic Steiner quadruple systems
- Hanani triple systems
- Trails of triples in partial triple systems
- Block disjoint difference families for Steiner triple systems: \(v\equiv 3 \mod 6\)
- On disjoint \((3t,3,1)\) cyclic difference families
- Product constructions for cyclic block designs. I: Steiner quadruple systems
- Nested group divisible designs and small nested designs
- The existence of resolvable Steiner quadruple systems
- A note on an inequality involving the normal distribution
- Steiner triple systems with rotational automorphisms
- Cyclic Steiner quadruple systems and Köhler's orbit graphs
- A new class of group divisible designs with block size three
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
- Orthogonal arrays. Theory and applications
- Optimal and pessimal orderings of Steiner triple systems in disk arrays.
- The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
- The last twenty orders of (1,2)-resolvable Steiner quadruple systems
- Egalitarian edge orderings of complete graphs
- Novák's conjecture on cyclic Steiner triple systems and its generalization
- Access balancing in storage systems by labeling partial Steiner systems
- Doubly resolvable Steiner quadruple systems and related designs
- A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
- Well-Balanced Designs for Data Placement
- The Existence of Well-Balanced Triple Systems
- MaxMinSum Steiner Systems for Access Balancing in Distributed Storage
- A Note on Steiner Triple Systems.
- Some Remarks on the Triple Systems of Steiner.
- Concentration Inequalities and Martingale Inequalities: A Survey
- Some 2-rotational and cyclic designs
- Combinatorial Designs
- Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage
- Resolvable Steiner Quadruple Systems for the Last 23 Orders
- Supermagic Complete Graphs
