04725nam a22006015i 4500 978-3-031-48679-1 DE-He213 20251030111808.0 cr nn 008mamaa 240408s2024 sz | s |||| 0|eng d 9783031486791 978-3-031-48679-1 10.1007/978-3-031-48679-1 doi QA241-247.5 PBH bicssc MAT022000 bisacsh PBH thema New Advances in Designs, Codes and Cryptography [electronic resource] : Stinson66, Toronto, Canada, June 13-17, 2022 / edited by Charles J. Colbourn, Jeffrey H. Dinitz. 1st ed. 2024. Cham : Springer Nature Switzerland : Imprint: Springer, 2024. XXVII, 425 p. 33 illus., 12 illus. in color. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Fields Institute Communications, 2194-1564 ; 86 Preface -- 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. This 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. Number theory. Quantum communication. 74824 Statistics . 65982 Computer science. 58552 Approximation theory. 74825 Number Theory. Quantum Communications and Cryptography. 74826 Statistics. 65982 Computer Science. 58552 Approximations and Expansions. 74827 Colbourn, Charles J. editor. edt http://id.loc.gov/vocabulary/relators/edt 74828 Dinitz, Jeffrey H. editor. edt http://id.loc.gov/vocabulary/relators/edt 74829 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783031486784 Printed edition: 9783031486807 Printed edition: 9783031486814 Fields Institute Communications, 2194-1564 ; 86 74830 https://doi.org/10.1007/978-3-031-48679-1 ZDB-2-SMA ZDB-2-SXMS 58992 58992