The following pages link to (Q4083446):
Displaying 50 items.
- Constructions of complex equiangular lines from mutually unbiased bases (Q300387) (← links)
- Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets (Q331153) (← links)
- A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes (Q492219) (← links)
- Mutually unbiased weighing matrices (Q498976) (← links)
- A generalization of Larman-Rogers-Seidel's theorem (Q534036) (← links)
- Exact point-distributions over the complex sphere (Q548089) (← links)
- t-designs in projective spaces (Q594880) (← links)
- An extremum problem for polynomials and bounds for codes with given distance and diameter (Q596963) (← links)
- Equiangular tight frames (Q613751) (← links)
- Bases for spin systems and qudits from angular momentum theory (Q718163) (← links)
- Sets of complex unit vectors with few inner products and distance-regular graphs (Q740270) (← links)
- The limitations of nice mutually unbiased bases (Q871276) (← links)
- Frame potentials and the geometry of frames (Q905616) (← links)
- A note on equiangular tight frames (Q927776) (← links)
- Semi-regular relative difference sets with large forbidden subgroups (Q958750) (← links)
- Cubature formulas in numerical analysis and Euclidean tight designs (Q966154) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- On the equivalence between real mutually unbiased bases and a certain class of association schemes (Q992778) (← links)
- Equiangular tight frames from Paley tournaments (Q996306) (← links)
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets (Q1003652) (← links)
- Discrete phase-space structure of \(n\)-qubit mutually unbiased bases (Q1009576) (← links)
- Unitary designs and codes (Q1035804) (← links)
- A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
- Commutative association schemes (Q1039424) (← links)
- Discrete hyperbolic geometry (Q1056380) (← links)
- On tight t-designs in compact symmetric spaces of rank one (Q1062063) (← links)
- \(t\)-designs with general angle set (Q1197621) (← links)
- Designs as maximum codes in polynomial metric spaces (Q1201908) (← links)
- Embedding edge-colored complete graphs in binary affine spaces (Q1229881) (← links)
- Line graphs, root systems, and elliptic geometry (Q1229893) (← links)
- Spherical codes and designs (Q1245838) (← links)
- Codes over GF(4) and complex lattices (Q1246504) (← links)
- Regular weights and the Johnson scheme (Q1355245) (← links)
- On lower bounds on the size of designs in compact symmetric spaces of rank 1 (Q1359065) (← links)
- Grassmannian frames with applications to coding and communication (Q1399700) (← links)
- Codes and designs in Grassmannian spaces. (Q1426105) (← links)
- On designs in compact metric spaces and a universal bound on their size (Q1584452) (← links)
- On the mathematical foundations of mutually unbiased bases (Q1617180) (← links)
- Discrete phase-space structures and Wigner functions for \(N\) qubits (Q1679378) (← links)
- Equiangular lines and subspaces in Euclidean spaces (Q1689890) (← links)
- Equiangular lines and spherical codes in Euclidean space (Q1692197) (← links)
- Equiangular subspaces in Euclidean spaces (Q1739198) (← links)
- Combinatorial constructions of packings in Grassmannian spaces (Q1741921) (← links)
- Geometry of the Welch bounds (Q1758450) (← links)
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
- Regular weights of full rank on strongly regular graphs (Q1817266) (← links)
- Linear programming bounds for codes in infinite projective spaces (Q1818899) (← links)
- Extremal polynomials for obtaining bounds for spherical codes and designs (Q1895969) (← links)
- Johan Jacob Seidel (Q1899392) (← links)
- Computing distance distributions of spherical designs (Q1899412) (← links)
