Classification Algorithms for Codes and Designs

By Petteri Kaski, Patric R. J. stergrd. 2005

266 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (2007, background): “The unresolved theoretical status withstanding, canonical labeling techniques are required in practice in a wide range of disciplines from chemistry to combinatorics and computer science [1] [10] [17] [21] [22].”
Hadamard Matrices of Order 32 (2013, methodology): “isomorph-free exhaustive generation (see [9, 19]), is to produce a unique representative for each of the isomorphism classes of objects.”
On the shape of a pure O-sequence (2010, unknown): “[41]).”
Complete enumeration of pure‐level and mixed‐level orthogonal arrays (2009, methodology): “The Minimum Complete Set algorithm, or MCS Algorithm, implements general principles from [15] to the specific case of generating a minimum complete set of OA(N ; s1, .”
Classification of Binary Constant Weight Codes (2010, background): “The author would like to thank A. Brouwer and the anonymous referees for comments and corrections.”
Construction, classification and parametrization of complex Hadamard matrices (2011, methodology): “For some advanced techniques we refer the reader to [78] and [93].”