Trails of triples in partial triple systems

Charles Colbourn, Daniel Horsley, Chengmin Wang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Given v, t, and m, does there exist a partial Steiner triple system of order v with t triples whose triples can be ordered so that any m consecutive triples are pairwise disjoint? Given v, t, and m 1,m 2,.. ,m s with t = Σ i=1 s m i, does there exist a partial Steiner triple system with t triples whose triples can be partitioned into partial parallel classes of sizes m 1,.. ,m s? An affirmative answer to the first question gives an affirmative answer to the second when m i ≥ m for each i ε {1, 2,.. ., s}. These questions arise in the analysis of erasure codes for disk arrays and that of codes for unipolar communication, respectively. A complete solution for the first problem is given when m is at most 1/3 (v - (9v) 2/3)+O(v 1/3).

Original languageEnglish (US)
Pages (from-to)199-212
Number of pages14
JournalDesigns, Codes, and Cryptography
Volume65
Issue number3
DOIs
StatePublished - Dec 2012

Fingerprint

Triple System
Steiner Triple System
Partial
Communication
Disk Array
Consecutive
Pairwise
Disjoint

Keywords

  • Kirkman signal set
  • Kirkman triple system Hanani triple system
  • Resolvable triple system
  • Steiner triple system

ASJC Scopus subject areas

  • Applied Mathematics
  • Computer Science Applications

Cite this

Trails of triples in partial triple systems. / Colbourn, Charles; Horsley, Daniel; Wang, Chengmin.

In: Designs, Codes, and Cryptography, Vol. 65, No. 3, 12.2012, p. 199-212.

Research output: Contribution to journalArticle

Colbourn, Charles ; Horsley, Daniel ; Wang, Chengmin. / Trails of triples in partial triple systems. In: Designs, Codes, and Cryptography. 2012 ; Vol. 65, No. 3. pp. 199-212.
@article{e8a8755fd0a549b8ba3e9d9bcb8734f9,
title = "Trails of triples in partial triple systems",
abstract = "Given v, t, and m, does there exist a partial Steiner triple system of order v with t triples whose triples can be ordered so that any m consecutive triples are pairwise disjoint? Given v, t, and m 1,m 2,.. ,m s with t = Σ i=1 s m i, does there exist a partial Steiner triple system with t triples whose triples can be partitioned into partial parallel classes of sizes m 1,.. ,m s? An affirmative answer to the first question gives an affirmative answer to the second when m i ≥ m for each i ε {1, 2,.. ., s}. These questions arise in the analysis of erasure codes for disk arrays and that of codes for unipolar communication, respectively. A complete solution for the first problem is given when m is at most 1/3 (v - (9v) 2/3)+O(v 1/3).",
keywords = "Kirkman signal set, Kirkman triple system Hanani triple system, Resolvable triple system, Steiner triple system",
author = "Charles Colbourn and Daniel Horsley and Chengmin Wang",
year = "2012",
month = "12",
doi = "10.1007/s10623-011-9521-1",
language = "English (US)",
volume = "65",
pages = "199--212",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Trails of triples in partial triple systems

AU - Colbourn, Charles

AU - Horsley, Daniel

AU - Wang, Chengmin

PY - 2012/12

Y1 - 2012/12

N2 - Given v, t, and m, does there exist a partial Steiner triple system of order v with t triples whose triples can be ordered so that any m consecutive triples are pairwise disjoint? Given v, t, and m 1,m 2,.. ,m s with t = Σ i=1 s m i, does there exist a partial Steiner triple system with t triples whose triples can be partitioned into partial parallel classes of sizes m 1,.. ,m s? An affirmative answer to the first question gives an affirmative answer to the second when m i ≥ m for each i ε {1, 2,.. ., s}. These questions arise in the analysis of erasure codes for disk arrays and that of codes for unipolar communication, respectively. A complete solution for the first problem is given when m is at most 1/3 (v - (9v) 2/3)+O(v 1/3).

AB - Given v, t, and m, does there exist a partial Steiner triple system of order v with t triples whose triples can be ordered so that any m consecutive triples are pairwise disjoint? Given v, t, and m 1,m 2,.. ,m s with t = Σ i=1 s m i, does there exist a partial Steiner triple system with t triples whose triples can be partitioned into partial parallel classes of sizes m 1,.. ,m s? An affirmative answer to the first question gives an affirmative answer to the second when m i ≥ m for each i ε {1, 2,.. ., s}. These questions arise in the analysis of erasure codes for disk arrays and that of codes for unipolar communication, respectively. A complete solution for the first problem is given when m is at most 1/3 (v - (9v) 2/3)+O(v 1/3).

KW - Kirkman signal set

KW - Kirkman triple system Hanani triple system

KW - Resolvable triple system

KW - Steiner triple system

UR - http://www.scopus.com/inward/record.url?scp=84868361050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868361050&partnerID=8YFLogxK

U2 - 10.1007/s10623-011-9521-1

DO - 10.1007/s10623-011-9521-1

M3 - Article

AN - SCOPUS:84868361050

VL - 65

SP - 199

EP - 212

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 3

ER -