Optimal and pessimal orderings of Steiner triple systems in disk arrays.
From MaRDI portal
Publication:1401294
DOI10.1016/S0304-3975(02)00634-5zbMath1044.68122MaRDI QIDQ1401294
Myra B. Cohen, Charles J. Colbourn
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (9)
Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Ladder orderings of pairs and RAID performance. ⋮ Egalitarian Steiner triple systems for data popularity ⋮ Overlap Cycles for Steiner Quadruple Systems ⋮ Twofold triple systems without 2-intersecting Gray codes ⋮ 1-overlap cycles for Steiner triple systems ⋮ Trails of triples in partial triple systems ⋮ Cycle Extensions in BIBD Block-Intersection Graphs ⋮ Cluttered orderings for the complete bipartite graph
Cites Work
- Coding techniques for handling failures in large disk arrays
- A new class of group divisible designs with block size three
- Asymptotically optimal erasure-resilient codes for large disk arrays.
- Construction Techniques for Anti-Pasch Steiner Triple Systems
- A geometric approach to root finding in GT(q/sup m/)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal and pessimal orderings of Steiner triple systems in disk arrays.
