𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)

✍ Scribed by Petteri Kaski, Patric R.J. Γ–stergΓ₯rd

Publisher
Springer
Year
2005
Tongue
English
Leaves
413
Series
Algorithms and Computation in Mathematics
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern computers and recent developments in algorithms that this topic has flourished and matured. This book is the first comprehensive reference on combinatorial classification algorithms, with emphasis on both the general theory and application to central families of combinatorial objects, in particular, codes and designs.

The accompanying DVD provides an exhaustive catalogue of combinatorial objects with small parameters.

The book will be of great interest to researchers and can be used as course material for graduate courses in both computer science and mathematics.

πŸ“œ SIMILAR VOLUMES

Classification Algorithms for Codes and
πŸ“ Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
✍ Petteri Kaski, Patric R.J. Ostergard, πŸ“‚ Library πŸ“… 2005 🌐 English

This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through modern

Classification Algorithms for Codes and
πŸ“ Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics, 15)
✍ Petteri Kaski, Patric R.J. Γ–stergΓ₯rd πŸ“‚ Library πŸ“… 2005 πŸ› Springer 🌐 English

<span>A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of

Classification Algorithms for Codes and
πŸ“ Classification Algorithms for Codes and Designs
✍ Petteri Kaski, Patric R.J. Γ–stergΓ₯rd (auth.) πŸ“‚ Library πŸ“… 2006 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of cl