This comprehensive, accessible reference contains all the facts on combinatorial designs. It includes constructions of designs, existence results and properties of designs. Organized into six main parts, The CRC Handbook of Combinatorial Designs covers block design; orthogonal arrays and latin squares; pairwise balanced designs; association schemes; mappings and sequencings; costas arrays; factorial designs; partial geometries; extensive applications of design theory; experimental design; coding theory; cryptography; and general reference tools used for design theory. Although the text emphasizes basic information on combinatorial design, it includes material at the research frontier, maintaining a balance of topics for those actively involved in research.
FREE Two-Day Shipping for Students. Learn more |
|
There is a newer edition of this item:
|
Book Description
Editorial Reviews
Review
"this Handbook is so useful (because) it contains the best current information on a very wide range of subjects." -The Mathematical Gazette, March 1997
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
A balanced incomplete block design (BIBD) is a pair (V, B) where V is a v-set and B is a collection of b k-subsets of V (blocks) such that each element of V is contained in exactly r blocks and any 2-subset of V is contained in exactly blocks. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
code with weights, balanced tournament designs, projective binary, symmetric orthogonal mate, balanced superimpositions, resolvable coverings, resolvable group divisible designs, equidistant permutation arrays, incomplete transversal designs, partial difference family, partial quasigroup, generalized weighing matrices, group testing problem, pairwise balanced designs, authentication matrix, quasigroup identities, distinct unordered pairs, diagonal latin squares, dicyclic groups, tuscan square, strongly regular graphs, partial geometries, partial spread, symmetric block designs, packed codes Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, New York, Theorem Let, John Wiley, Ars Combin, Cambridge University Press, Example Let, Theorem Suppose, Remark There, Codes Crypt, Remark Theorem, Utilitas Math, Bhaskar Rao, Collection of Surveys, Theorem There, Academic Press, Lecture Notes, Tran van Trung, Contemporary Design Theory, Remark Let, Parameter Tables, Construction Let, London Math, Example Consider, Marcel Dekker New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
A balanced incomplete block design (BIBD) is a pair (V, B) where V is a v-set and B is a collection of b k-subsets of V (blocks) such that each element of V is contained in exactly r blocks and any 2-subset of V is contained in exactly blocks. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
code with weights, balanced tournament designs, projective binary, symmetric orthogonal mate, balanced superimpositions, resolvable coverings, resolvable group divisible designs, equidistant permutation arrays, incomplete transversal designs, partial difference family, partial quasigroup, generalized weighing matrices, group testing problem, pairwise balanced designs, authentication matrix, quasigroup identities, distinct unordered pairs, diagonal latin squares, dicyclic groups, tuscan square, strongly regular graphs, partial geometries, partial spread, symmetric block designs, packed codes Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, New York, Theorem Let, John Wiley, Ars Combin, Cambridge University Press, Example Let, Theorem Suppose, Remark There, Codes Crypt, Remark Theorem, Utilitas Math, Bhaskar Rao, Collection of Surveys, Theorem There, Academic Press, Lecture Notes, Tran van Trung, Contemporary Design Theory, Remark Let, Parameter Tables, Construction Let, London Math, Example Consider, Marcel Dekker New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
8
books
cite this book:
See all 8 books citing this book
- Discrete Mathematics Using Latin Squares by Charles F. Laywine on 4 pages
- Surveys in Combinatorics, 1999 (London Mathematical Society Lecture Note Series) by J. D. Lamb on page 87, and page 97
- Surveys in Combinatorics, 2001 (London Mathematical Society Lecture Note Series) by J. W. P. Hirschfeld on page 71
- A Course in Combinatorics by J. H. van Lint on page 301
- Geometries on Surfaces (Encyclopedia of Mathematics and its Applications) by Burkard Polster in Back Matter
See all 8 books citing this book
Books on Related Topics
(learn more)
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Operating Systems
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering
- Books > New & Used Textbooks > Computer Science > Algorithms
- Books > New & Used Textbooks > Computer Science > Operating Systems
- Books > New & Used Textbooks > Science & Mathematics > Mathematics > Algebra & Trigonometry
- Books > Science & Math > Mathematics
