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

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

Hadamard matrices in {0,1} presentation are square m× m matrices whose entries are zeros and ones and whose rows considered as vectors in R^m produce the Gram matrix of a special form with respect to the standard scalar product in R^m. The concept of Hadamard matrices is extended in the present paper. As a result pseudo-Hadamard matrices of the first generation are defined and investigated. An algorithm for generating these pseudo-Hadamard matrices is designed and is used for testing some conjectures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2021

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

Hadamard matrices are square n× n matrices whose entries are ones and mi...
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
02/20/2023

A Vectorised Packing Algorithm for Efficient Generation of Custom Traffic Matrices

We propose a new algorithm for generating custom network traffic matrice...
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
07/02/2022

A Structured Sparse Neural Network and Its Matrix Calculations Algorithm

Gradient descent optimizations and backpropagation are the most common m...
research
08/29/2014

Binary matrices of optimal autocorrelations as alignment marks

We define a new class of binary matrices by maximizing the peak-sidelobe...

Please sign up or login with your details

Forgot password? Click here to reset