Mutually unbiased bush-type Hadamard matrices and association schemes
From MaRDI portal
(Redirected from Publication:2517656)
Abstract: It was shown by LeCompte, Martin, and Oweans in 2010 that the existence of mutually unbiased Hadamard matrices and the identity matrix, which coincide with mutually unbiased bases, is equivalent to that of a -polynomial association scheme of class four which is both -antipodal and -bipartite. We prove that the existence of a set of mutually unbiased Bush-type Hadamard matrices is equivalent to that of an association scheme of class five. As an application of this equivalence, we obtain the upper bound of the number of mutually unbiased Bush-type Hadamard matrices of order to be . This is in contrast to the fact that the upper bound of mutually unbiased Hadamard matrices of order is . We also discuss a relation of our scheme to some fusion schemes which are -antipodal and -bipartite -polynomial of class .
Recommendations
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 124523 (Why is no real title available?)
- scientific article; zbMATH DE number 665696 (Why is no real title available?)
- Deza graphs: A generalization of strongly regular graph
- Imprimitive cometric association schemes: constructions and analysis
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- On the real unbiased Hadamard matrices
- Rank 5 association schemes and triality
- Strongly regular designs of the second kind
- Three-class association schemes
- Unbiased complex Hadamard matrices and bases
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
Cited in
(10)- Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
- Some Bush-type Hadamard matrices
- Linked systems of symmetric group divisible designs of type. II
- LCD subspace codes
- Bush-type Butson Hadamard matrices
- Balancedly splittable Hadamard matrices
- Linked systems of symmetric group divisible designs
- Unbiased orthogonal designs
- Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
- Symmetric Bush-type generalized Hadamard matrices and association schemes
This page was built for publication: Mutually unbiased bush-type Hadamard matrices and association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2517656)