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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| 版: | 1st ed. 2006. |
| 叢編: | Algorithms and Computation in Mathematics
15 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
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 |
| LEADER | 04411nam a22004817a 4500 | ||
|---|---|---|---|
| 001 | 938370 | ||
| 008 | 080410q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN123127521 | ||
| 020 | |a 9783540289913 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.6 | ||
| 084 | |a 05-xx. 2000 | ||
| 084 | |a 68-xx. 2000 | ||
| 084 | |a 94-xx. 2000 | ||
| 100 | 1 | |a Kaski, Petteri. | |
| 245 | 1 | 0 | |a Classification algorithms for codes and designs |c Petteri Kaski, Patric R.J. Östergård. |
| 250 | |a 1st ed. 2006. | ||
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Algorithms and Computation in Mathematics |v 15 | |
| 500 | |a Description d'après consultation du 14 mars 2011 | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 504 | |a Notes bibliogr. Index | ||
| 505 | 1 | |a 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work on various objects, including (what became later known as) Steiner triple systems led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation | ||
| 650 | |a Théorie combinatoire des ensembles | ||
| 650 | |a Télécommunications | ||
| 650 | |a Codage | ||
| 700 | 1 | |a Östergård, Patric R. J. |4 aut | |
| 700 | 1 | |a Östergård, Patric RJ. |4 aut | |
| 776 | 0 | |0 113267231 |t Classification algorithms for codes and designs |f Petteri Kaski, Patric R.J. Östergård |c Berlin |n Springer |d 2006 |p 1 vol. (XII-412 p.) |s Algorithms and computation in mathematics |z 3-540-28990-9 | |
| 776 | 0 | |t Classification Algorithms for Codes and Designs |b Texte imprimé |z 9783540815785 | |
| 776 | 0 | |0 113267231 |t Classification algorithms for codes and designs |f Petteri Kaski, Patric R.J. Östergård |c Berlin |n Springer |d 2006 |p 1 vol. (XII-412 p.) |s Algorithms and computation in mathematics |z 3-540-28990-9 | |
| 776 | 0 | |t Classification Algorithms for Codes and Designs |b Texte imprimé |z 9783642432507 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-28991-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-1FJ7K2VR-L |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747900086 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/3-540-28991-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750913134 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/3-540-28991-7 |z Accès INSA CVL | |
| 997 | |0 938370 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||