國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algebraic design theory and Hadamard...

(1998 :)

Algebraic design theory and Hadamard matricesADTHM, Lethbridge, Alberta, Canada, July 2014 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algebraic design theory and Hadamard matricesedited by Charles J. Colbourn.
其他題名:	ADTHM, Lethbridge, Alberta, Canada, July 2014 /
其他作者:	Colbourn, Charles J.
團體作者:
出版者:	Cham :Springer International Publishing :2015.
面頁冊數:	xi, 259 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Combinatorial designs and configurationsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-17729-8
ISBN:	9783319177298$q(electronic bk.)

Algebraic design theory and Hadamard matricesADTHM, Lethbridge, Alberta, Canada, July 2014 /
Algebraic design theory and Hadamard matricesADTHM, Lethbridge, Alberta, Canada, July 2014 /[electronic resource] :edited by Charles J. Colbourn. - Cham :Springer International Publishing :2015. - xi, 259 p. :ill., digital ;24 cm. - Springer proceedings in mathematics & statistics,v.1332194-1009 ;. - Springer proceedings in mathematics & statistics ;v.19..

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$q(electronic bk.)

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

731694
Combinatorial designs and configurations
--Congresses.

LC Class. No.: QA166.25

Dewey Class. No.: 511.6

Algebraic design theory and Hadamard matricesADTHM, Lethbridge, Alberta, Canada, July 2014 /
LDR:03364nmm a2200325 a 4500 001 476909
003 DE-He213
005 20160412162446.0
006 m d
007 cr nn 008maaau
008 160526s2015 gw s 0 eng d
020 $a 9783319177298$q(electronic bk.)
020 $a 9783319177281$q(paper)
024 7 $a 10.1007/978-3-319-17729-8 $2 doi
035 $a 978-3-319-17729-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.25
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
082 0 4 $a 511.6 $2 23
090 $a QA166.25 $b .W926 2014
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xi, 259 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer proceedings in mathematics & statistics, $x 2194-1009 ; $v 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 Combinatorial designs and configurations $v Congresses. $3 731694
650 0 $a Hadamard matrices $v Congresses. $3 731695
650 1 4 $a Mathematics. $3 184409
650 2 4 $a Combinatorics. $3 274788
650 2 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 274063
650 2 4 $a Number Theory. $3 274059
650 2 4 $a Information and Communication, Circuits. $3 276027
700 1 $a Colbourn, Charles J. $3 725834
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Springer proceedings in mathematics & statistics ; $v v.19. $3 569116
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-17729-8
950 $a Mathematics and Statistics (Springer-11649)