Equiangular tight frames with centroidal symmetry

DOI10.1016/j.acha.2016.06.004zbMath1380.42025arXiv1509.04059OpenAlexW2963799975MaRDI QIDQ1690710

Cody E. Watson, Matthew Fickus, John Jasper, Dustin G. Mixon, Jesse D. Peterson

Publication date: 12 January 2018

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.04059

zbMATH Keywords

strongly regular graphequiangular tight frame

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) General harmonic expansions, frames (42C15)

Related Items

Upper bounds for \(s\)-distance sets and equiangular lines, Properties of certain multi-angle tight frames in \(\mathbb{R}^d\), Frames of uniform subframe bounds with applications to erasures, Hadamard equiangular tight frames, Tremain equiangular tight frames, Uniform approximation property of frames with applications to erasure recovery, Equiangular tight frames from group divisible designs, Harmonic cubic homogeneous polynomials such that the norm-squared of the Hessian is a multiple of the Euclidean quadratic form, Grassmannian codes from paired difference sets, Doubly transitive lines. I: Higman pairs and roux, Optimal line packings from nonabelian groups, Frames over finite fields: equiangular lines in orthogonal geometry, Regular two-distance sets, Polyphase equiangular tight frames and abelian generalized quadrangles

Cites Work

• Two are better than one: fundamental parameters of frame coherence
• The road to deterministic matrices with the restricted isometry property
• Steiner equiangular tight frames
• On the construction of equiangular frames from graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• On the existence of equiangular tight frames
• Grassmannian frames with applications to coding and communication
• Optimal frames for erasures.
• There is no (75,32,10,16) strongly regular graph
• Tight \(p\)-fusion frames
• Finite two-distance tight frames
• Robust dimension reduction, fusion frames, and Grassmannian packings
• Achieving the Welch Bound With Difference Sets
• A Generic Construction of Complex Codebooks Meeting the Welch Bound
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• The nonexistence of certain tight spherical designs
• Kirkman Equiangular Tight Frames and Codes
• Strongly Regular Graphs Derived from Combinatorial Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item