LEADER 04645nam 22007095 450 001 9910300252403321 005 20251230065901.0 010 $a3-319-17729-X 024 7 $a10.1007/978-3-319-17729-8 035 $a(CKB)3710000000471380 035 $a(EBL)4178204 035 $a(SSID)ssj0001584826 035 $a(PQKBManifestationID)16265181 035 $a(PQKBTitleCode)TC0001584826 035 $a(PQKBWorkID)14864494 035 $a(PQKB)10963594 035 $a(DE-He213)978-3-319-17729-8 035 $a(MiAaPQ)EBC4178204 035 $a(PPN)190524871 035 $a(EXLCZ)993710000000471380 100 $a20150903d2015 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAlgebraic Design Theory and Hadamard Matrices $eADTHM, Lethbridge, Alberta, Canada, July 2014 /$fedited by Charles J. Colbourn 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (261 p.) 225 1 $aSpringer Proceedings in Mathematics & Statistics,$x2194-1017 ;$v133 300 $aDescription based upon print version of record. 311 08$a3-319-17728-1 320 $aIncludes bibliographical references at the end of each chapters. 327 $aOn (?1, 1)-matrices of skew type with the maximal determinants and tournaments -- On good matrices and skew Hadamard matrices -- Suitable permutations, binary covering arrays, and Paley matrices -- Divisible design digraphs -- New symmetric (61,16,4) designs obtained from codes -- D-optimal matrices of orders 118, 138, 150, 154 and 174 -- Periodic Golay pairs of length 72 -- Classifying cocyclic Butson Hadamard matrices -- Signed group orthogonal designs and their applications -- On symmetric designs and binary 3-frameproof codes -- An algorithm for constructing Hjelmslev planes -- Mutually unbiased biangular vectors and association schemes -- A simple construction of complex equiangular lines -- Inner product vectors for skew-Hadamard matrices -- Twin bent functions and Clifford algebras -- A Walsh?Fourier approach to the circulant Hadamard matrices -- A note on order and eigenvalue multiplicity of strongly regular graphs -- Trades in complex Hadamard matrices -- The hunt for weighting matrices of small orders -- Menon?Hadamard difference sets obtained from a local field by natural projections -- BIRS Workshop 14w2199 July 11?13, 2014 Problem Solving Session. 330 $aThis volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important applications in cryptography, quantum information theory, communications, and networking. 410 0$aSpringer Proceedings in Mathematics & Statistics,$x2194-1017 ;$v133 606 $aDiscrete mathematics 606 $aAlgebras, Linear 606 $aNumber theory 606 $aComputer science$xMathematics 606 $aDiscrete Mathematics 606 $aLinear Algebra 606 $aNumber Theory 606 $aMathematical Applications in Computer Science 615 0$aDiscrete mathematics. 615 0$aAlgebras, Linear. 615 0$aNumber theory. 615 0$aComputer science$xMathematics. 615 14$aDiscrete Mathematics. 615 24$aLinear Algebra. 615 24$aNumber Theory. 615 24$aMathematical Applications in Computer Science. 676 $a511.6 702 $aColbourn$b Charles J$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910300252403321 996 $aAlgebraic design theory and Hadamard matrices$91522633 997 $aUNINA