Handbook of combinatorial designs
edited by Charles J. Colbourn, Jeffrey H. Dinitz.
Bok Engelsk 2007 · Electronic books.
| Utgitt | Boca Raton, Fla. : : CRC/Taylor & Francis, , ©2007.
|
|---|---|
| Omfang | 1 online resource (1011 p.)
|
| Utgave | 2nd ed.
|
| Opplysninger | Revised edition of: The CRC handbook of combinatorial designs. c1996.. - Front cover; Preface; Editors-in-Chief; Contributors; Contents; 1 Opening the Door; 2 Design Theory: Antiquity to 1950; 1 2-( , , ) Designs of Small Order; 2 Triple Systems; 3 BIBDs with Small Block Size; 4 t-Designs with t 3; 5 Steiner Systems; 6 Symmetric Designs; 7 Resolvable and Near-Resolvable Designs; 1 Latin Squares; 2 Quasigroups; 3 Mutually Orthogonal Latin Squares (MOLS); 4 Incomplete MOLS; 5 Self-Orthogonal Latin Squares (SOLS); 6 Orthogonal Arrays of Index More Than One; 7 Orthogonal Arrays of Strength More Than Two; 1 PBDs and GDDs: The Basics; 2 PBDs: Recursive Constructions. - 3 PBD-Closure4 Group Divisible Designs; 5 PBDs, Frames, and Resolvability; 6 Pairwise Balanced Designs as Linear Spaces; 1 Hadamard Matrices and Hadamard Designs; 2 Orthogonal Designs; 3 D-Optimal Matirces; 4 Bhaskar Rao Designs; 5 Generalized Hadamard Matrices; 6 Balanced Generalized Weighing Matrices and Conference Matrices; 7. Sequence Correlation; 8 Complementary, Base, and Turyn Sequences; 9 Optical Orthogonal Codes; 1 Association Schemes; 2 Balanced Ternary Designs; 3 Balanced Tournament Designs; 4 Bent Functions; 5 Block-Transitive Designs. - 30 Infinite Designs31 Linear Spaces: Geometric Aspects; 32 Lotto Designs; 33 Low Density Parity Check Codes; 34 Magic Squares; 35 Mendelsohn Designs; 36 Nested Designs; 37 Optimality and Efficiency: Comparing Block Designs; 38 Ordered Designs, Perpendicular Arrays, and Permutation Sets; 39 Orthogonal Main Effect Plans; 40 Packings; 41 Partial Geometries; 42 Partially Balanced Incomplete Block Designs; 43 Perfect Hash Families; 44 Permutation Codes and Arrays; 45 Permutation Polynomials; 46 Pooling Designs; 47 Quasi-3 Designs; 48 Quasi-Symmetric Designs; 49 (r, )-designs; 50 Room Squares. - 51 Scheduling a Tournament52 Secrecy and Authentication Codes; 53 Skolem and Langford Sequences; 54 Spherical Designs; 55 Starters; 56 Superimposed Codes and Combinatorial Group Testing; 57 Supersimple Designs; 58 Threshold and Ramp Schemes; 59 (t,m,s)-Nets; 60 Trades; 61 Tur ́an Systems; 62 Tuscan Squares; 63 t-Wise Balanced Designs; 64 Whist Tournaments; 65 Youden Squares and Generalized Youden Designs; 1 Codes; 2 Finite Geometry; 3 Divisible Semiplanes; 4 Graphs and Multigraphs; 5 Factorizations of Graphs; 6 Computational Methods in Design Theory; 7 Linear Algebra and Designs. - 6 Complete Mappings and Sequencings of Finite Groups7 Configurations; 8 Correlation-immune and Resilient Functions; 9 Costas Arrays; 10 Covering Arrays; 11 Coverings; 12 Cycle Decompositions; 13 Defining Sets; 14 Deletion-correcting Codes; 15 Derandomization; 16 Difference Families; 17 Difference Matrices; 18 Difference Sets; 19 Difference Triangle Sets; 20 Directed Designs; 21 Factorial Designs; 22 Frequency Squares and Hypercubes; 23 Generalized Quadrangles; 24 Graph Decompositions; 25 Graph Embeddings and Designs; 26 Graphical Designs; 27 Grooming; 28 Hall Triple Systems; 29 Howell Designs. - 8 Number Theory and Finite Fields. - Continuing in the bestselling, informative tradition of the first edition, this second edition remains the only resource to contain all of the most important results and tables in the area of combinatorial design. The handbook covers the constructions of designs, existence results, properties of designs, and applications of designs. Over 30% longer than the first edition, it contains new chapters on the history of design theory, various codes, bent functions, and numerous designs as well as updated tables, including BIBDs, PBDs, MOLS, and Hadamard matrices. With expanded and updated coverage,
|
| Emner | |
| Sjanger | |
| Dewey | |
| ISBN | 0-429-13848-2. - 1-280-73371-3. - 1-4200-1054-9. - 1-4398-3234-X. - 9786610733712
|
