Skip to main content
SpringerLink
Log in

Classification Algorithms for Codes and Designs

  • Book
  • © 2006

Overview

Authors:
  1. Petteri Kaski

    1. Department of Computer Science and Engineering, Helsinki University of Technology, Helsinki, Finland

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Patric R.J. Östergård

    1. Department of Electrical and Communications, Engineering Helsinki University of Technology, Helsinki, Finland

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Excellent interdisciplinary monograph on highly applications relevant topic
  • Provides the first comprehensive reference on combinatorial classification algorithms
  • Addresses both the general theory and application to central families of combinatorial objects

Part of the book series: Algorithms and Computation in Mathematics (AACIM, volume 15)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Introduction

    • Petteri Kaski, Patric R.J. Östergård
    Pages 1-5

  3. Graphs, Designs, and Codes

    • Petteri Kaski, Patric R.J. Östergård
    Pages 7-45

  4. Representations and Isomorphism

    • Petteri Kaski, Patric R.J. Östergård
    Pages 47-104

  5. Isomorph-Free Exhaustive Generation

    • Petteri Kaski, Patric R.J. Östergård
    Pages 105-143

  6. Auxiliary Algorithms

    • Petteri Kaski, Patric R.J. Östergård
    Pages 145-173

  7. Classification of Designs

    • Petteri Kaski, Patric R.J. Östergård
    Pages 175-218

  8. Classification of Codes

    • Petteri Kaski, Patric R.J. Östergård
    Pages 219-258

  9. Classification of Related Structures

    • Petteri Kaski, Patric R.J. Östergård
    Pages 259-271

  10. Prescribing Automorphism Groups

    • Petteri Kaski, Patric R.J. Östergård
    Pages 273-295

  11. Validity of Computational Results

    • Petteri Kaski, Patric R.J. Östergård
    Pages 297-305

  12. Computational Complexity

    • Petteri Kaski, Patric R.J. Östergård
    Pages 307-337

  13. Nonexistence of Projective Planes of Order 10

    • Petteri Kaski, Patric R.J. Östergård
    Pages 339-364

  14. Back Matter

    Pages 365-412
    Download chapter PDF
Back to top

Keywords

About this book

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.

Reviews

From the reviews:

"The authors of this book have been responsible for some quite remarkable combinatorial enumeration results … . They are therefore well-qualified to provide this comprehensive survey of state-of-the-art algorithms for the classification of codes and designs. … Overall the book is a timely and authoritative work, and an extremely valuable reference for any researcher working in the field of combinatorial classification." (Peter B.Gibbons, Zentralblatt MATH, Vol. 1089 (15), 2006)

"For any researcher involved with combinatorial algorithms, this book is a must-have. It is absolutely essential for anyone doing enumeration algorithms on t-designs or codes. … This is one of the few useful books on combinatorial design algorithms. … Finally, the book contains (open) research problems sprinkled throughout, which should be useful for researchers … . It would make a good textbook for a senior undergraduate or a graduate course on computing in design and coding theory." (G. H. J. Van Rees and Pak Ching Li, Mathematical Reviews, Issue 2008 a)

Authors and Affiliations

  • Department of Computer Science and Engineering, Helsinki University of Technology, Helsinki, Finland

    Petteri Kaski

  • Department of Electrical and Communications, Engineering Helsinki University of Technology, Helsinki, Finland

    Patric R.J. Östergård

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation