LEADER 04608nam 22006975 450 001 9910847578903321 005 20240408130437.0 010 $a3-031-48679-X 024 7 $a10.1007/978-3-031-48679-1 035 $a(CKB)31403750300041 035 $a(MiAaPQ)EBC31255234 035 $a(Au-PeEL)EBL31255234 035 $a(MiAaPQ)EBC31267105 035 $a(Au-PeEL)EBL31267105 035 $a(DE-He213)978-3-031-48679-1 035 $a(EXLCZ)9931403750300041 100 $a20240408d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aNew Advances in Designs, Codes and Cryptography$b[electronic resource] $eStinson66, Toronto, Canada, June 13-17, 2022 /$fedited by Charles J. Colbourn, Jeffrey H. Dinitz 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (442 pages) 225 1 $aFields Institute Communications,$x2194-1564 ;$v86 311 $a3-031-48678-1 327 $aPreface -- Introduction -- Mutually orthogonal binary frequency squares of mixed type -- Heffter arrays from finite fields -- A survey on constructive resolution methods for the Oberwolfach problem and its varients -- Asymptomatic existence of egalitarian Steiner 2-designs -- Private computations on set intersection -- Colourings of path systems -- A New Lower Bound on the Share Size of Leakage Resilient Secret Sharing Schemes -- Small transitive homogenous 3-(v,{4,6}, 1) designs -- Cryptography, Codes, and Keys: An Authenticated Key Exchange Protocol from Code-Based Cryptography -- Aspects of Methods for Constructing Random Steiner Triple Systems -- Decomposing Complete Graphs into Isomorphic Complete Multipartite Graphs -- Cover-Free Families: constructions, applications and generalizations -- Group rings and character sums: tricks of the trade -- An alternative existence proof for LSTS(24k+1) -- On a class of optimal constant weight codes -- Quaternary Legendre pairs -- Self orthogonal Latin squares and Room squares -- On the spectrum of large sets plus of partitioned incomplete Latin squares with type gn(2g)1 -- On the Optimization of Pippenger's Bucket Method for Precomputation -- Block Size Five - Quo Vadis? -- A survey of Heffter arrays -- Orthogonal and strong frame starters, revisited -- An efficient Screening Method -- Bibliography -- Index. 330 $aThis volume records and disseminates selected papers from the Stinson66 conference, including surveys, prospectives, and papers presenting original and current research. It contains four accessible surveys of topics in combinatorial designs and related topics, ranging from a tutorial survey of connections to classical group theory, to surveys of "hot topics" in current research. It also contains a prospective paper identifying topics for future research efforts, co-authored by one of the elder statesmen of the field, Alex Rosa. Finally, the research papers examine topics ranging from pure mathematics to applied work in computing, networking, communications, and cryptography. For students and newcomers to these topics, the volume provides accessible survey material that does not have onerous prerequisites. The breadth of topics reflects the vibrancy of the field in a way that can be appreciated by all researchers. The papers present important advances on theory and applications, which also benefit advanced researchers. 410 0$aFields Institute Communications,$x2194-1564 ;$v86 606 $aNumber theory 606 $aQuantum communication 606 $aStatistics 606 $aComputer science 606 $aApproximation theory 606 $aNumber Theory 606 $aQuantum Communications and Cryptography 606 $aStatistics 606 $aComputer Science 606 $aApproximations and Expansions 615 0$aNumber theory. 615 0$aQuantum communication. 615 0$aStatistics. 615 0$aComputer science. 615 0$aApproximation theory. 615 14$aNumber Theory. 615 24$aQuantum Communications and Cryptography. 615 24$aStatistics. 615 24$aComputer Science. 615 24$aApproximations and Expansions. 676 $a512.7 700 $aColbourn$b Charles J$066846 701 $aDinitz$b Jeffrey H$0535017 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910847578903321 996 $aNew Advances in Designs, Codes and Cryptography$94156128 997 $aUNINA