Recent Results on the Classification of Combinatorial Objects
Basic combinatorial objects (codes, designs, etc.) used in practical applications are often tailored to specific soft and hard requirements.
If an exhaustive collection of nonisomorphic objects with given parameters is available, the objects can easily be tested and filtered with respect to the additional requirements. Advances in classification algorithms and the ever increasing computing resources available to researchers have made it possible to obtain classification results that by many were considered unachievable. In this talk, a few results that have been obtained since the appearance of the monograph "P. Kaski and P.R.J. Ostergard, Classification Algorithms for Codes and Designs, Springer, Berlin, 2006" are discussed.
Patric Östergård, Helsinki University of Technology, Finland