04332nam a22005175i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003500118050001600153072001600169072002300185072001500208245017600223250001800399264006900417300006700486336002600553337002600579338003600605347002400641490005400665505137800719520103802097650001903135650002703154650001803181650002203199650002603221650001903247650004503266650001603311650002203327650003503349700008203384700008003466710003403546773002603580776003603606776003603642776003603678830005403714856004603768978-3-031-48679-1DE-He21320251030111808.0cr nn 008mamaa240408s2024 sz | s |||| 0|eng d a97830314867917 a10.1007/978-3-031-48679-12doi 4aQA241-247.5 7aPBH2bicssc 7aMAT0220002bisacsh 7aPBH2thema10aNew Advances in Designs, Codes and Cryptographyh[electronic resource] :bStinson66, Toronto, Canada, June 13-17, 2022 /cedited by Charles J. Colbourn, Jeffrey H. Dinitz. a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024. aXXVII, 425 p. 33 illus., 12 illus. in color.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aFields Institute Communications,x2194-1564 ;v860 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. 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. 0aNumber theory. 0aQuantum communication. 0aStatisticsĀ . 0aComputer science. 0aApproximation theory.14aNumber Theory.24aQuantum Communications and Cryptography.24aStatistics.24aComputer Science.24aApproximations and Expansions.1 aColbourn, Charles J.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt1 aDinitz, Jeffrey H.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt2 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303148678408iPrinted edition:z978303148680708iPrinted edition:z9783031486814 0aFields Institute Communications,x2194-1564 ;v8640uhttps://doi.org/10.1007/978-3-031-48679-1