作者: Yanxun Chang , Bingli Fan , Tao Feng , Derek F. Holt , Patric R. J. Östergård
DOI: 10.1002/JCD.21530
关键词:
摘要: The problem of classifying cyclic Steiner quadruple systems (CSQSs) is considered. A computational approach shows that the number isomorphism classes such designs with orders 26 and 28 52,170 1,028,387, respectively. It further shown CSQSs order 2p, where p a prime, are isomorphic iff they multiplier equivalent. Moreover, no less than or equal to 38 but not