English

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

Combinatorics 2021-05-05 v1 Data Structures and Algorithms

Abstract

Hadamard matrices are square n×nn\times 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 Rn\Bbb 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.

Keywords

Cite

@article{arxiv.2105.01485,
  title  = {Hadamard matrices in $\{0,1\}$ presentation and an algorithm for generating them},
  author = {Ruslan Sharipov},
  journal= {arXiv preprint arXiv:2105.01485},
  year   = {2021}
}

Comments

AmSTeX, 12 pages, amsppt style

R2 v1 2026-06-24T01:46:05.145Z