Construction of extended Steiner systems for information retrieval.
Construction of Menon designs with parameters (784,378,182) and (900,435,210).
Construction of Perpendicular Steiner. Quasigroups
Construction of Perpendicular Steiner Quasigroups. (Short Communications).
Construction of Skew Room Squares.
Constructions for resolvable and related designs.
Control treatments in designs with split units generated by Latin squares
This paper deals with two-factor experiments with split units. The whole plot treatments occur in a repeated Latin square, modified Latin square or Youden square, while subplot treatments occur in a block design within the whole plots. The statistical properties of the considered designs are examined. Special attention is paid to the case where one of the treatments is an individual control or an individual standard treatment. In addition, we give a brief overview of work on the design of experiments...
Correction to the paper "A note on inequivalent Hadamard matrices".
Cyclotomy and complementary difference sets
Die Varietät der auflösbaren Ternare der Ordnung 2
Differenzmengen und zweifach transitive Permutationsgruppen von Primzahlgrad.
Distributive Steiner quasigroups of order
Divisible designs admitting a Suzuki group as an automorphism group
Si costruiscono, facendo uso delle rette dei piani di Lüneburg e degli ovali di Tits, due classi di disegni divisibili ipersemplici che ammettono il gruppo di Suzuki ( con ) come gruppo di automorfismi. Inoltre si studiano le strutture ottenute determinandone le orbite di .
Do (1276, 51, 2) difference sets exist?
D-optimal weighing designs for four and five objects.
Double Resolvability of Some Complete 3-Designs.
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Efficient covering designs of the complete graph.
Eigenvalues of nonsingular matices and combinatorial applications
Eine Charakterisierung der (i, j)-Pläne.