Hadamard matrices in {0,1} presentation and an algorithm for generating them

05/04/2021
by   Ruslan Sharipov, et al.
0

Hadamard matrices are square n× n matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in R^n. Each Hadamard matrix can be transformed to a matrix whose entries are zeros and ones. This presentation of Hadamard matrices is investigated in the paper and based on it an algorithm for generating them is designed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2021

Pseudo-Hadamard matrices of the first generation and an algorithm for producing them

Hadamard matrices in {0,1} presentation are square m× m matrices whose e...
research
07/01/2020

Density of diagonalizable matrices in sets of structured matrices defined from indefinite scalar products

For an (indefinite) scalar product [x,y]_B = x^HBy for B= ± B^H ∈ Gl_n(ℂ...
research
01/30/2018

Surjectivity of near square random matrices

We show that a nearly square iid random integral matrix is surjective ov...
research
06/02/2016

Convolutional Imputation of Matrix Networks

A matrix network is a family of matrices, where the relationship between...
research
01/02/2022

A new combinatorial approach for Tracy-Widom law of Wigner matrices

In this paper we introduce a new combinatorial approach to analyze the t...
research
10/16/2018

Compatibility and attainability of matrices of correlation-based measures of concordance

Necessary and sufficient conditions are derived under which concordance ...
research
06/21/2021

Multiplying Matrices Without Multiplying

Multiplying matrices is among the most fundamental and compute-intensive...

Please sign up or login with your details

Forgot password? Click here to reset