๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial designs: constructions and analysis

โœ Scribed by Douglas R. Stinson


Book ID
127421364
Publisher
Springer
Year
2004
Tongue
English
Weight
1 MB
Edition
1
Category
Library
City
New York
ISBN
0387217371

No coin nor oath required. For personal study only.

โœฆ Synopsis


Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatiorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applied math, combinatorics, and applied statistics will find the book an essential resource.


๐Ÿ“œ SIMILAR VOLUMES


Combinatorial constructions for optimal
โœ Kai-Tai Fang; Gennian Ge; Min-Qian Liu; Hong Qin ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this pap

New constructions for perfect hash famil
โœ D. R. Stinson; R. Wei; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 141 KB ๐Ÿ‘ 1 views

In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and

Combinatorial designs and algebras
โœ I. Sh. o. Aliev ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 666 KB