Unbiased orthogonal designs
From MaRDI portal
Publication:1647571
DOI10.1007/s10623-017-0414-9zbMath1390.05035arXiv1601.04416OpenAlexW2962988436MaRDI QIDQ1647571
Publication date: 26 June 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04416
association schemesorthogonal designsweighing matricesquasi-unbiased matricesunbiased orthogonal designs
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mutually unbiased weighing matrices
- Spreads in strongly regular graphs
- Weighing matrices and spherical codes
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- On the existence of Hadamard matrices
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
- Mutually unbiased bush-type Hadamard matrices and association schemes
- Unbalanced Hadamard matrices and finite projective planes of even order
- Strongly regular graphs, partial geometries and partially balanced designs
- Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach
- Generalized Hadamard Matrices
- Using product designs to construct orthogonal designs
- A two-fold cover of strongly regular graphs with spreads and association schemes of class five