CRC Handbook of Combinatorial DesignsCharles J. Colbourn From experimental design to cryptography, this comprehensive, easy-to-access reference contains literally all the facts you need 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: |
Contents
VI | 3 |
VII | 41 |
VIII | 47 |
IX | 66 |
X | 75 |
XI | 87 |
XII | 97 |
XIII | 111 |
LII | 396 |
LIII | 400 |
LIV | 406 |
LV | 409 |
LVI | 414 |
LVII | 419 |
LVIII | 424 |
LIX | 430 |
XIV | 142 |
XV | 172 |
XVI | 179 |
XVII | 185 |
XVIII | 193 |
XIX | 203 |
XX | 213 |
XXI | 220 |
XXII | 224 |
XXIII | 229 |
XXIV | 233 |
XXV | 238 |
XXVI | 241 |
XXVII | 246 |
XXVIII | 253 |
XXIX | 256 |
XXX | 260 |
XXXI | 266 |
XXXII | 270 |
XXXIII | 287 |
XXXIV | 297 |
XXXV | 308 |
XXXVI | 312 |
XXXVII | 317 |
321 | |
XXXIX | 323 |
XL | 326 |
XLI | 329 |
XLII | 354 |
XLIII | 357 |
361 | |
XLV | 366 |
XLVI | 370 |
XLVII | 377 |
XLVIII | 381 |
XLIX | 386 |
L | 388 |
LI | 394 |
LX | 434 |
LXI | 437 |
LXII | 442 |
LXIII | 447 |
LXIV | 452 |
LXV | 457 |
LXVI | 462 |
LXVII | 467 |
LXVIII | 474 |
LXIX | 478 |
LXX | 480 |
LXXI | 484 |
LXXII | 490 |
LXXIII | 492 |
LXXIV | 496 |
LXXV | 504 |
LXXVI | 508 |
LXXVII | 511 |
LXXVIII | 517 |
541 | |
LXXX | 547 |
LXXXI | 556 |
LXXXII | 559 |
LXXXIII | 562 |
LXXXIV | 563 |
LXXXV | 576 |
LXXXVI | 585 |
LXXXVII | 613 |
LXXXVIII | 642 |
LXXXIX | 651 |
XC | 665 |
684 | |
XCII | 692 |
XCIII | 706 |
XCIV | 716 |
739 | |
Other editions - View all
Common terms and phrases
1-factorizations abelian group algorithm automorphism group base blocks BIBD binary C.J. Colbourn codewords column Combinatorial combinatorial designs Construction contains coset Costas array cyclic D.R. Stinson Defining contrast denoted difference families difference sets Dinitz Discrete Math elements equivalent Example exists factor factorial design finite group G group of order Hadamard matrices integers isomorphic linear space lines Mathon matrix modulo MOLS nonisomorphic orthogonal arrays orthogonal latin squares pair pairwise parallel classes parameters partial geometry partition PBIBD permutation plane of order points positive integers prime power projective plane projective space quasigroup Remark resolvable Room squares satisfying self-dual codes self-orthogonal Skolem sequences square of order square of side starter Steiner systems Steiner triple systems strongly regular graph subgroup subset subspace symbols symmetric designs t-designs Table Theorem Theorems 3.3 tournament design treatment combinations two-graph vector vertices