Classification algorithms for codes and designs
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 class...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edizione: | 1st ed. 2006. |
| Serie: | Algorithms and Computation in Mathematics
15 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Description d'après consultation du 14 mars 2011 Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Classification algorithms for codes and designs, Petteri Kaski, Patric R.J. Östergård, Berlin, Springer, 2006, 1 vol. (XII-412 p.), Algorithms and computation in mathematics, 3-540-28990-9 • Classification Algorithms for Codes and Designs, Texte imprimé, 9783540815785 • Classification algorithms for codes and designs, Petteri Kaski, Patric R.J. Östergård, Berlin, Springer, 2006, 1 vol. (XII-412 p.), Algorithms and computation in mathematics, 3-540-28990-9 • Classification Algorithms for Codes and Designs, Texte imprimé, 9783642432507 |
Sommario:
- Graphs, Designs, and Codes Representations and Isomorphism Isomorph-Free Exhaustive Generation Auxiliary Algorithms Classification of Designs Classification of Codes Classification of Related Structures Prescribing Automorphism Groups Validity of Computational Results Computational Complexity Nonexistence of Projective Planes of Order 10