On the construction of equiangular frames from graphs
DOI10.1016/J.LAA.2009.07.016zbMATH Open1216.05079OpenAlexW1996425172MaRDI QIDQ734936FDOQ734936
Authors: Shayne Waldron 
Publication date: 14 October 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.07.016
Recommendations
tight framesignal processingadjacency matrixinformation theorySeidel matrixalgebraic graph theorymutually unbiased basisfinite frameGrassmannian frametwo angle frame
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Symmetry properties of polytopes (52B15) Communication, information (94A99)
Cites Work
- Finite Fields and Applications
- Quantized frame expansions with erasures
- An introduction to frames and Riesz bases
- Grassmannian frames with applications to coding and communication
- On the existence of equiangular tight frames
- Optimal frames for erasures.
- Frames, graphs and erasures
- Title not available (Why is that?)
- Symmetric informationally complete quantum measurements
- Complex equiangular cyclic frames and erasures
- Equiangular tight frames from complex Seidel matrices containing cube roots of unity
- Title not available (Why is that?)
- Geometric properties of Grassmannian frames for \(\mathbb R^2\) and \(\mathbb R^3\)
- Equiangular spherical codes in quantum cryptography
Cited In (50)
- Frame graph
- The road to deterministic matrices with the restricted isometry property
- Grassmannian codes from paired difference sets
- Doubly transitive lines. I: Higman pairs and roux
- The symmetry group of a finite frame
- Packings in real projective spaces
- Determinantal sampling designs
- Construction of \(k\)-angle tight frames
- Equiangular Frames and Their Duals
- DCACO: an algorithm for designing incoherent redundant matrices
- Finite frame theory
- Equiangular tight frames from group divisible designs
- Geometry of the Welch bounds
- Properties of real and complex ETFs and their application to the design of low coherence frames
- Equiangular frames and generalizations of the Welch bound to dual pairs of frames
- Steiner equiangular tight frames
- Robust Eigenvectors of Symmetric Tensors
- Equiangular tight frames and signature sets in groups
- Frames of uniform subframe bounds with applications to erasures
- Harmonic equiangular tight frames comprised of regular simplices
- Lattices from tight frames and vertex transitive graphs
- Properties of certain multi-angle tight frames in \(\mathbb{R}^d\)
- Killing metrized commutative nonassociative algebras associated with Steiner triple systems
- Deterministic bounds for restricted isometry in compressed sensing matrices
- On maximal relative projection constants
- Finite two-distance tight frames
- On the construction and properties of frames using incidence matrix of graphs and their spectra
- Bounds for the sum of distances of spherical sets of small size
- Polyphase equiangular tight frames and abelian generalized quadrangles
- Tight frame graphs arising as line graphs
- Saturated configuration and new large construction of equiangular lines
- Tremain equiangular tight frames
- New upper bounds for equiangular lines by pillar decomposition
- Complex equiangular cyclic frames and erasures
- Low coherence unit norm tight frames
- Tight frames generated by a graph short-time Fourier transform
- On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns
- Regular two-distance sets
- Hadamard equiangular tight frames
- Frames over finite fields: equiangular lines in orthogonal geometry
- Equiangular tight frames and unistochastic matrices
- Constructions and restrictions for balanced splittable Hadamard matrices
- The real equiangular tight frames obtained from rank 3 graphs
- Bounds on antipodal spherical designs with few angles
- Equiangular lines and the Lemmens-Seidel conjecture
- Upper bounds for \(s\)-distance sets and equiangular lines
- Equiangular tight frames that contain regular simplices
- The entanglement criteria based on equiangular tight frames
- Equiangular tight frames with centroidal symmetry
- Numerically erasure-robust frames
This page was built for publication: On the construction of equiangular frames from graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734936)
