Affine resolvable incomplete block designs
Affine Triple Systems and Matroid Designs.
An infinite family of non-embeddable Hadamard designs.
Applying balanced generalized weighing matrices to construct block designs.
Automorphism Groups of Designs.
Balanced ternary designs with block size three, any ... and any R.
Block Intersections in Quasi-Residual Designs.
Block Intersections in Quasi-Residual Designs. (Short Communication).
Bounding the Rank of Certain Permutation Groups.
Characterisation of Some Steiner Systems, Parallelisms, and Biplanes.
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant...
Classification of the Steiner quadruple systems of cardinality 32
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs.
Class-uniformly resolvable group divisible structures. II: Frames.
Coherent configurations I
Colouring 4-cycle systems with specified block colour patterns: The case of embedding -designs.
Combinatorial Structures in Loops.
Composing T-designs
Configuration of mutually perspective triangles
Constructing a Canonical form of a Matrix in Several Problems about Combinatorial Designs
Partially supported by the Bulgarian Science Fund contract with TU Varna, No 487.The author developed computer programs needed for the classification of designs with certain automorphisms by the local approach method. All these programs use canonicity test or/and construction of canonical form of an integer matrix. Their efficiency substantially influences the speed of the whole computation. The present paper deals with the implemented canonicity algorithm. It is based on ideas used by McKay, Meringer,...