Mutually unbiased bush-type Hadamard matrices and association schemes
From MaRDI portal
Publication:2517656
zbMath1325.05184arXiv1412.5297MaRDI QIDQ2517656
Sara Sasani, Hadi Kharaghani, Sho Suda
Publication date: 27 August 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5297
association schemefusion schemeBush-type Hadamard matrixDeza graphfirst and second eigenmatrixHigman graph
Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Group actions on combinatorial structures (05E18)
Related Items (7)
Balancedly splittable Hadamard matrices ⋮ Unbiased orthogonal designs ⋮ Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach ⋮ LCD subspace codes ⋮ Linked systems of symmetric group divisible designs ⋮ Linked systems of symmetric group divisible designs of type. II ⋮ Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unbiased complex Hadamard matrices and bases
- Imprimitive cometric association schemes: constructions and analysis
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- Three-class association schemes
- Strongly regular designs of the second kind
- Rank 5 association schemes and triality
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
- Deza graphs: A generalization of strongly regular graph
This page was built for publication: Mutually unbiased bush-type Hadamard matrices and association schemes