Linked systems of symmetric group divisible designs of type. II
DOI10.1007/s10623-019-00622-zzbMath1419.05219arXiv1710.07888OpenAlexW2963653441WikidataQ128333126 ScholiaQ128333126MaRDI QIDQ2324770
Publication date: 12 September 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.07888
association schemeHadamard matrixmutually orthogonal Latin squaresymmetric group divisible designaffine resolvable design
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Symmetric groups (20B30)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- Some new orthogonal designs in linear regression models
- Subschemes of some association schemes
- Symmetric group divisible designs with the dual property
- Three-class association schemes
- On a decomposition of complete graphs
- Balancedly splittable Hadamard matrices
- Linked systems of symmetric group divisible designs
- Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes
- Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems
- Mutually unbiased bush-type Hadamard matrices and association schemes
- 2-walk-regular dihedrants from group-divisible designs
- Mutually Unbiased Biangular Vectors and Association Schemes
- Using product designs to construct orthogonal designs
- Combinatorial Designs
- Construction of strongly regular graphs using affine designs
This page was built for publication: Linked systems of symmetric group divisible designs of type. II
