On One Construction Method for Hadamard Matrices
Mercè Villanueva, Victor A. Zinoviev, Dimitrii Zinoviev · Problems of Information Transmission · 2022
Using a concatenated construction for $$q$$ -ary codes, we construct codes over $$\mathbb{Z}_q$$ in the Lee metrics which after a proper mapping to the binary alphabet (which in the case of $$\mathbb{Z}_4$$ is the well-known Gray map) become binary Hadamard codes (in particular, Hadamard matrices). Our construction allows to increase the rank and the kernel dimension of the resulting Hadamard code. Using computer search, we construct new nonequivalent Hadamard matrices of orders $$32$$ , $$48$$ , and $$64$$ with various fixed values of the rank and the kernel dimension in the range of possible values. It was found that in a special case, our construction coincides with the Kronecker (or Sylvester) construction and can be regarded as a version of a presently known [1] modified Sylvester construction which uses one Hadamard matrix of order $$m$$ and $$m$$ (not necessarily distinct) Hadamard matrices of order $$k$$ . We generalize this modified construction by proposing a more general Sylvester-type construction based on two families of (not necessarily distinct) Hadamard matrices, namely, on $$k$$ matrices of order $$m$$ and $$m$$ matrices of order $$k$$ . The resulting matrix is of order $$mk$$ , as in the construction from [1].