Equiangular tight frames from group divisible designs

DOI10.1007/s10623-018-0569-zzbMath1426.42026arXiv1803.07468OpenAlexW2962864603WikidataQ129117608 ScholiaQ129117608MaRDI QIDQ2420477

Matthew Fickus, John Jasper

Publication date: 6 June 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphsequiangular tight framesgroup divisible designs

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15)

Related Items

Doubly transitive lines. I: Higman pairs and roux, Harmonic equiangular tight frames comprised of regular simplices

Uses Software

• central-group-frames

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two are better than one: fundamental parameters of frame coherence
• The road to deterministic matrices with the restricted isometry property
• The asymptotic existence of group divisible designs of large order with index one
• Steiner equiangular tight frames
• On the construction of equiangular frames from graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
• Equiangular lines and covers of the complete graph
• A note on equiangular tight frames
• Equiangular tight frames from complex Seidel matrices containing cube roots of unity
• Equiangular tight frames from Paley tournaments
• On the existence of equiangular tight frames
• On the existence of abelian Hadamard difference sets and a new family of difference sets
• Quasi-symmetric designs and codes meeting the Grey-Rankin bound
• A unifying construction for difference sets
• Grassmannian frames with applications to coding and communication
• Optimal frames for erasures.
• Equiangular tight frames with centroidal symmetry
• There is no (75,32,10,16) strongly regular graph
• Complex Hadamard matrices and equiangular tight frames
• Decompositions of edge-colored complete graphs
• Optimal line packings from nonabelian groups
• Finite two-distance tight frames
• Tremain equiangular tight frames
• Character sums and difference sets
• Equiangular lines
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• A family of difference sets in non-cyclic groups
• Equiangular Tight Frames From Hyperovals
• QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY
• Complex equiangular Parseval frames and Seidel matrices containing 𝑝th roots of unity
• Designing structured tight frames via an alternating projection method
• 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.)
• Fibonacci-Lucas SIC-POVMs
• Symmetric informationally complete quantum measurements
• Kirkman Equiangular Tight Frames and Codes
• Strongly Regular Graphs Derived from Combinatorial Designs
• A family of difference sets