Classification of Cyclic Steiner Quadruple Systems

Yanxun Chang, Bingli Fan, Tao Feng, Derek F. Holt, Patric R J Östergård

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)


The problem of classifying cyclic Steiner quadruple systems (CSQSs) is considered. A computational approach shows that the number of isomorphism classes of such designs with orders 26 and 28 is 52,170 and 1,028,387, respectively. It is further shown that CSQSs of order 2p, where p is a prime, are isomorphic iff they are multiplier equivalent. Moreover, no CSQSs of order less than or equal to 38 are isomorphic but not multiplier equivalent.

Original languageEnglish
Number of pages19
JournalJournal of Combinatorial Designs
Issue number3
Early online date5 Aug 2016
Publication statusPublished - Mar 2017
MoE publication typeA1 Journal article-refereed


  • Cyclic design
  • Steiner quadruple system
  • Transitive permutation group


Dive into the research topics of 'Classification of Cyclic Steiner Quadruple Systems'. Together they form a unique fingerprint.

Cite this