Optimal and pessimal orderings of Steiner triple systems in disk arrays

Myra B. Cohen, Charles Colbourn

Research output: Contribution to journalConference articlepeer-review

13 Scopus citations


Steiner triple systems are well studied combinatorial designs that have been shown to possess properties desirable for the construction of multiple erasure codes in RAID architectures. The ordering of the columns in the parity check matrices of these codes affects system performance. Combinatorial problems involved in the generation of good and bad column orderings are defined, and examined for small numbers of accesses to consecutive data blocks in the disk array.

Original languageEnglish (US)
Pages (from-to)103-117
Number of pages15
JournalTheoretical Computer Science
Issue number1-3
StatePublished - 2003
EventLatin American Theoretical Informatics - Punta del Este, Uruguay
Duration: Apr 10 2000Apr 14 2000


  • Design configuration
  • Disk array
  • Erasure code
  • Raid
  • Steiner triple system

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Optimal and pessimal orderings of Steiner triple systems in disk arrays'. Together they form a unique fingerprint.

Cite this