Handbook of Combinatorial Designs
eBook - PDF

Handbook of Combinatorial Designs

  1. 1,016 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Handbook of Combinatorial Designs

About this book

Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design. This handbook covers the constructions, properties, and applications of designs as well as existence

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Handbook of Combinatorial Designs by Charles J. Colbourn, Jeffrey H. Dinitz, Charles J. Colbourn,Jeffrey H. Dinitz in PDF and/or ePUB format, as well as other popular books in Computer Science & Operating Systems. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Chapman and Hall/CRC
Year
2006
Print ISBN
9780367248291
eBook ISBN
9781420010541
Edition
2
Topic
Computer Science
Subtopic
Operating Systems
Index
Computer Science

Table of contents

  1. Cover
  2. Title
  3. Copyright
  4. Preface
  5. Editors-in-Chief
  6. Contributors
  7. Contents
  8. Part I: Introduction
  9. 1 Opening the Door
  10. 2 Design Theory: Antiquity to 1950
  11. Part II: Block Designs
  12. 1 2-(v, k, Lambda) Designs of Small Order
  13. 2 Triple Systems
  14. 3 BIBDs with Small Block Size
  15. 4 t-Designs with t Greater-Than Or Equal To 3
  16. 5 Steiner Systems
  17. 6 Symmetric Designs
  18. 7 Resolvable and Near-Resolvable Designs
  19. Part III: Latin Squares
  20. 1 Latin Squares
  21. 2 Quasigroups
  22. 3 Mutually Orthogonal Latin Squares (MOLS)
  23. 4 Incomplete MOLS
  24. 5 Self-Orthogonal Latin Squares (SOLS)
  25. 6 Orthogonal Arrays of Index More Than One
  26. 7 Orthogonal Arrays of Strength More Than Two
  27. Part IV: Pairwise Balanced Designs
  28. 1 PBDs and GDDs: The Basics
  29. 2 PBDs: Recursive Constructions
  30. 3 PBD-Closure
  31. 4 Group Divisible Designs
  32. 5 PBDs, Frames, and Resolvability
  33. 6 Pairwise Balanced Designs as Linear Spaces
  34. Part V: Hadamard Matrices and Related Designs
  35. 1 Hadamard Matrices and Hadamard Designs
  36. 2 Orthogonal Designs
  37. 3 D-Optimal Matrices
  38. 4 Bhaskar Rao Designs
  39. 5 Generalized Hadamard Matrices
  40. 6 Balanced Generalized Weighing Matrices and Conference Matrices
  41. 7 Sequence Correlation
  42. 8 Complementary, Base, and Turyn Sequences
  43. 9 Optical Orthogonal Codes
  44. Part VI: Other Combinatorial Designs
  45. 1 Association Schemes
  46. 2 Balanced Ternary Designs
  47. 3 Balanced Tournament Designs
  48. 4 Bent Functions
  49. 5 Block-Transitive Designs
  50. 6 Complete Mappings and Sequencings of Finite Groups
  51. 7 Configurations
  52. 8 Correlation-immune and Resilient Functions
  53. 9 Costas Arrays
  54. 10 Covering Arrays
  55. 11 Coverings
  56. 12 Cycle Decompositions
  57. 13 Defining Sets
  58. 14 Deletion-correcting Codes
  59. 15 Derandomization
  60. 16 Difference Families
  61. 17 Difference Matrices
  62. 18 Difference Sets
  63. 19 Difference Triangle Sets
  64. 20 Directed Designs
  65. 21 Factorial Designs
  66. 22 Frequency Squares and Hypercubes
  67. 23 Generalized Quadrangles
  68. 24 Graph Decompositions
  69. 25 Graph Embeddings and Designs
  70. 26 Graphical Designs
  71. 27 Grooming
  72. 28 Hall Triple Systems
  73. 29 Howell Designs
  74. 30 Infinite Designs
  75. 31 Linear Spaces: Geometric Aspects
  76. 32 Lotto Designs
  77. 33 Low Density Parity Check Codes
  78. 34 Magic Squares
  79. 35 Mendelsohn Designs
  80. 36 Nested Designs
  81. 37 Optimality and Effciency: Comparing Block Designs
  82. 38 Ordered Designs, Perpendicular Arrays, and Permutation Sets
  83. 39 Orthogonal Main Effect Plans
  84. 40 Packings
  85. 41 Partial Geometries
  86. 42 Partially Balanced Incomplete Block Designs
  87. 43 Perfect Hash Families
  88. 44 Permutation Codes and Arrays
  89. 45 Permutation Polynomials
  90. 46 Pooling Designs
  91. 47 Quasi-3 Designs
  92. 48 Quasi-Symmetric Designs
  93. 50 Room Squares
  94. 51 Scheduling a Tournament
  95. 52 Secrecy and Authentication Codes
  96. 53 Skolem and Langford Sequences
  97. 54 Spherical Designs
  98. 55 Starters
  99. 56 Superimposed Codes and Combinatorial Group Testing
  100. 57 Supersimple Designs
  101. 58 Threshold and Ramp Schemes
  102. 59 (t,m,s)-Nets
  103. 60 Trades
  104. 61 Turán Systems
  105. 62 Tuscan Squares
  106. 63 t-Wise Balanced Designs
  107. 64 Whist Tournaments
  108. 65 Youden Squares and Generalized Youden Designs
  109. Part VII: Related Mathematics
  110. 1 Codes
  111. 2 Finite Geometry
  112. 3 Divisible Semiplanes
  113. 4 Graphs and Multigraphs
  114. 5 Factorizations of Graphs
  115. 6 Computational Methods in Design Theory
  116. 7 Linear Algebra and Designs
  117. 8 Number Theory and Finite Fields
  118. 9 Finite Groups and Designs
  119. 10 Designs and Matroids
  120. 11 Strongly Regular Graphs
  121. 12 Directed Strongly Regular Graphs
  122. 13 Two-Graphs
  123. Bibliography
  124. Index