Unbiased orthogonal designs

DOI10.1007/S10623-017-0414-9MaRDI QIDQ1647571zbMATH OpenOpenAlexFDO

Authors H. Kharaghani, Sho Suda

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

zbMATH Keywords

association schemesorthogonal designsquasi-unbiased matricesunbiased orthogonal designsweighing matrices

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30)

Abstract: The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually unbiased orthogonal designs. As an application, mutually quasi-unbiased weighing matrices for various parameters are obtained.

Recommendations

• Unbiased Hadamard matrices and bases
• scientific article; zbMATH DE number 2192080
• Mutually unbiased weighing matrices
• On the real unbiased Hadamard matrices
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach

Cites work

• A two-fold cover of strongly regular graphs with spreads and association schemes of class five
• Generalized Hadamard Matrices
• scientific article; zbMATH DE number 3935054 (Why is no real title available?)
• scientific article; zbMATH DE number 124523 (Why is no real title available?)
• scientific article; zbMATH DE number 3637895 (Why is no real title available?)
• scientific article; zbMATH DE number 2002850 (Why is no real title available?)
• Mutually unbiased bush-type Hadamard matrices and association schemes
• Mutually unbiased weighing matrices
• On the equivalence between real mutually unbiased bases and a certain class of association schemes
• On the existence of Hadamard matrices
• On the real unbiased Hadamard matrices
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
• Spreads in strongly regular graphs
• Strongly regular graphs, partial geometries and partially balanced designs
• Unbalanced Hadamard matrices and finite projective planes of even order
• Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
• Using product designs to construct orthogonal designs
• Weighing matrices and spherical codes

Cited in

(10)

• Balancedly splittable orthogonal designs and equiangular tight frames
• Orthogonal uniform composite designs
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
• scientific article; zbMATH DE number 472934 (Why is no real title available?)
• On binary codes related to mutually quasi-unbiased weighing matrices
• scientific article; zbMATH DE number 874530 (Why is no real title available?)
• Mutually unbiased weighing matrices
• Code construction of some quasi-unbiased weighing matrices
• Constructions of self-orthogonal and LCD subspace codes
• Almost perfect mutually unbiased bases that are sparse

This page was built for publication: Unbiased orthogonal designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647571)