New Advances in Designs, Codes and Cryptography

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.