Projekteja vuodessa
Abstrakti
Several methods for generating random Steiner triple systems (STSs)
have been proposed in the literature, such as Stinson’s hill-climbing
algorithm and Cameron’s algorithm, but these are not yet completely
understood. Those algorithms, as well as some variants, are here
assessed for STSs of both small and large orders. For large orders,
the number of occurrences of certain configurations in the constructed
STSs are compared with the corresponding expected values of random
hypergraphs. Modifications of the algorithms are proposed.
have been proposed in the literature, such as Stinson’s hill-climbing
algorithm and Cameron’s algorithm, but these are not yet completely
understood. Those algorithms, as well as some variants, are here
assessed for STSs of both small and large orders. For large orders,
the number of occurrences of certain configurations in the constructed
STSs are compared with the corresponding expected values of random
hypergraphs. Modifications of the algorithms are proposed.
| Alkuperäiskieli | Englanti |
|---|---|
| Otsikko | New Advances in Designs, Codes and Cryptography |
| Kustantaja | Springer |
| Sivumäärä | 24 |
| ISBN (elektroninen) | 978-3-031-48679-1 |
| ISBN (painettu) | 978-3-031-48678-4 |
| DOI - pysyväislinkit | |
| Tila | Sähköinen julkaisu (e-pub) ennen painettua julkistusta - 16 marrask. 2023 |
| OKM-julkaisutyyppi | A3 Kirjan tai muun kokoomateoksen osa |
Sormenjälki
Sukella tutkimusaiheisiin 'Constructing Random Steiner Triple Systems: An Experimental Study'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.Projektit
- 1 Päättynyt
-
SubspaceCodes: Constructions and Classifications of Subspace Codes and Related Structures for Communication Networks
Heinlein, D.
01/09/2020 → 31/08/2023
Projekti: Academy of Finland: Other research funding