Asymptotic Existence of Egalitarian Steiner 2-Designs

被引：0
|
作者：
Colbourn, Charles J. [1 ]
机构：
[1] Arizona State Univ, Sch Comp & Augmented Intelligence, Tempe, AZ 85287 USA
来源：
NEW ADVANCES IN DESIGNS, CODES AND CRYPTOGRAPHY, NADCC 2022 | 2024年 / 86卷
关键词：
TRIPLE-SYSTEMS;
D O I：
10.1007/978-3-031-48679-1_4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
引用
收藏
页码：63 / 75
页数：13
相关论文
共 50 条
  • [21] Existence of strong difference families and constructions for eight new 2-designs
    Wang, Xiaomiao
    Feng, Tao
    Wang, Shixin
    JOURNAL OF COMBINATORIAL DESIGNS, 2021, 29 (04) : 225 - 242
  • [22] CONSTRUCTION OF 2-DESIGNS
    Wu Chuankun\ Zhao Likuan
    Applied Mathematics:A Journal of Chinese Universities, 1999, (01) : 101 - 104
  • [23] On the existence of tight relative 2-designs on binary Hamming association schemes
    Bannai, Eiichi
    Bannai, Etsuko
    Bannai, Hideo
    DISCRETE MATHEMATICS, 2014, 314 : 17 - 37
  • [24] Switching for 2-designs
    Crnkovic, Dean
    Svob, Andrea
    DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (07) : 1585 - 1593
  • [25] RECURSIVE CONSTRUCTIONS FOR RESOLVABLE AND DOUBLY RESOLVABLE 1-ROTATIONAL STEINER 2-DESIGNS
    JIMBO, M
    VANSTONE, SA
    UTILITAS MATHEMATICA, 1984, 26 (NOV) : 45 - 61
  • [26] Construction of 2-designs
    Wu C.
    Zhao L.
    Applied Mathematics-A Journal of Chinese Universities, 1999, 14 (1) : 99 - 102
  • [27] Switching for 2-designs
    Dean Crnković
    Andrea Švob
    Designs, Codes and Cryptography, 2022, 90 : 1585 - 1593
  • [28] Pairwise transitive 2-designs
    Devillers, Alice
    Praeger, Cheryl E.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2015, 132 : 246 - 270
  • [29] The asymptotic existence of orthogonal designs
    Ghaderpour, E.
    Kharaghani, H.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 58 : 333 - 346
  • [30] THE NON-ABELIAN GROUP OF ORDER 26 ACTING ON STEINER 2-DESIGNS S(2, 6, 91)
    Crnkovic, Dean
    Danilovic, Doris dumicic
    RAD HRVATSKE AKADEMIJE ZNANOSTI I UMJETNOSTI-MATEMATICKE ZNANOSTI, 2025, 29 (564): : 37 - 61
12345