Classification Algorithms for Codes and Designs / Edition 1

Classification Algorithms for Codes and Designs / Edition 1

by Petteri Kaski, Patric R.J. Ostergard, Patric R. J. Vstergerd
     
 

ISBN-10: 3540289909

ISBN-13: 9783540289906

Pub. Date: 12/22/2005

Publisher: Springer Berlin Heidelberg

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

Overview

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.

Product Details

ISBN-13:
9783540289906
Publisher:
Springer Berlin Heidelberg
Publication date:
12/22/2005
Series:
Algorithms and Computation in Mathematics Series, #15
Edition description:
2006
Pages:
412
Product dimensions:
6.10(w) x 9.25(h) x 0.24(d)

Table of Contents

1 Introduction.- 2 Graphs, Designs, and Codes.- 3 Representations and Isomorphism.- 4 Isomorph-Free Exhaustive Generation.- 5 Auxiliary Algorithms.- 6 Classification of Designs.- 7 Classification of Codes.- 8 Classification of Related Structures.- 9 Prescribing Automorphism Groups.- 10 Validity of Computational Results.- 11 Computational Complexity.- 12 Nonexistence of Projective Planes of Order 10.- References.- Problem Index.- Index

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >