engleski

On some codes and divisible designs constructed from Hadamard matrices

In this talk we present a construction of a class of regular Hadamard matrices. From orbit matrices of the corresponding Menon designs we construct classes of self-orthogonal or self-dual codes. Further, we describe construction of divisible design graphs using Hadamard matrices. Divisible design graphs have been introduced in 2011 by W. H. Haemers, H. Kharaghani and M. A. Meulenberg.

code; Hadamard matrix; divisible design graph

nije evidentirano