Cargando…

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Kaski, Petteri (Autor), Östergård, Patric R.J (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Algorithms and Computation in Mathematics ; 15
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-28991-3
003 DE-He213
005 20220116192216.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 |a 9783540289913  |9 978-3-540-28991-3 
024 7 |a 10.1007/3-540-28991-7  |2 doi 
050 4 |a QA297.4 
072 7 |a PBD  |2 bicssc 
072 7 |a MAT036000  |2 bisacsh 
072 7 |a PBD  |2 thema 
082 0 4 |a 511.1  |2 23 
100 1 |a Kaski, Petteri.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Classification Algorithms for Codes and Designs  |h [electronic resource] /  |c by Petteri Kaski, Patric R.J. Östergård. 
250 |a 1st ed. 2006. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2006. 
300 |a XI, 412 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Algorithms and Computation in Mathematics ;  |v 15 
505 0 |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. 
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 0 |a Discrete mathematics. 
650 0 |a Mathematics-Data processing. 
650 0 |a Coding theory. 
650 0 |a Information theory. 
650 0 |a Telecommunication. 
650 0 |a Signal processing. 
650 1 4 |a Discrete Mathematics. 
650 2 4 |a Computational Mathematics and Numerical Analysis. 
650 2 4 |a Coding and Information Theory. 
650 2 4 |a Communications Engineering, Networks. 
650 2 4 |a Signal, Speech and Image Processing . 
700 1 |a Östergård, Patric R.J.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540815785 
776 0 8 |i Printed edition:  |z 9783540289906 
776 0 8 |i Printed edition:  |z 9783642432507 
830 0 |a Algorithms and Computation in Mathematics ;  |v 15 
856 4 0 |u https://doi.uam.elogim.com/10.1007/3-540-28991-7  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)