國立虎尾科技大學 |

Algebraic Design Theory and Hadamard Matrices = ADTHM, Lethbridge, Alberta, Canada, July 2014 /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algebraic Design Theory and Hadamard Matrices/ edited by Charles J. Colbourn.
其他題名:	ADTHM, Lethbridge, Alberta, Canada, July 2014 /
其他作者:	Colbourn, Charles J.
面頁冊數:	XI, 259 p. 95 illus., 69 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Combinatorics. -
電子資源:	https://doi.org/10.1007/978-3-319-17729-8
ISBN:	9783319177298

Algebraic Design Theory and Hadamard Matrices = ADTHM, Lethbridge, Alberta, Canada, July 2014 /
Algebraic Design Theory and Hadamard MatricesADTHM, Lethbridge, Alberta, Canada, July 2014 /[electronic resource] :edited by Charles J. Colbourn. - 1st ed. 2015. - XI, 259 p. 95 illus., 69 illus. in color.online resource. - Springer Proceedings in Mathematics & Statistics,1332194-1009 ;. - Springer Proceedings in Mathematics & Statistics,125.

On (−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.

This 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.

ISBN: 9783319177298

Standard No.: 10.1007/978-3-319-17729-8doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Algebraic Design Theory and Hadamard Matrices = ADTHM, Lethbridge, Alberta, Canada, July 2014 /
LDR:03796nam a22004095i 4500 001 963521
003 DE-He213
005 20200703113334.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319177298 $9 978-3-319-17729-8
024 7 $a 10.1007/978-3-319-17729-8 $2 doi
035 $a 978-3-319-17729-8
050 4 $a QA164-167.2
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
245 1 0 $a Algebraic Design Theory and Hadamard Matrices $h [electronic resource] : $b ADTHM, Lethbridge, Alberta, Canada, July 2014 / $c edited by Charles J. Colbourn.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XI, 259 p. 95 illus., 69 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Proceedings in Mathematics & Statistics, $x 2194-1009 ; $v 133
505 0 $a On (−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.
520 $a This 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.
650 0 $a Combinatorics. $3 669353
650 0 $a Matrix theory. $3 1023862
650 0 $a Algebra. $2 gtt $3 579870
650 0 $a Number theory. $3 527883
650 0 $a Information theory. $3 595305
650 2 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 672090
650 2 4 $a Number Theory. $3 672023
650 2 4 $a Information and Communication, Circuits. $3 671312
700 1 $a Colbourn, Charles J. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1069798
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319177281
776 0 8 $i Printed edition: $z 9783319177304
776 0 8 $i Printed edition: $z 9783319372181
830 0 $a Springer Proceedings in Mathematics & Statistics, $x 2194-1009 ; $v 125 $3 1253690
856 4 0 $u https://doi.org/10.1007/978-3-319-17729-8
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)