2019
DOI: 10.1016/j.acha.2017.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Toward the classification of biangular harmonic frames

Abstract: Equiangular tight frames (ETFs) and biangular tight frames (BTFs) -sets of unit vectors with basis-like properties whose pairwise absolute inner products admit exactly one or two values, respectivelyare useful for many applications. A well-understood class of ETFs are those which manifest as harmonic frames -vector sets defined in terms of the characters of finite abelian groups -because they are characterized by combinatorial objects called difference sets.This work is dedicated to the study of the underlying… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 50 publications
0
6
0
Order By: Relevance
“…For instance, it is well-known that equiangular tight frames can be constructed from difference sets or Steiner systems, see [8,22]. Likewise, divisible difference sets and partial difference sets are used to construct biangular tight frames [4]. We will continue to exploit some families of block designs to construct desired sets.…”
Section: Construction Regular Two-distance Setsmentioning
confidence: 99%
“…For instance, it is well-known that equiangular tight frames can be constructed from difference sets or Steiner systems, see [8,22]. Likewise, divisible difference sets and partial difference sets are used to construct biangular tight frames [4]. We will continue to exploit some families of block designs to construct desired sets.…”
Section: Construction Regular Two-distance Setsmentioning
confidence: 99%
“…Manipulating (20) gives an expression for n − d = dim(span{ψ j } n j=1 ) in terms of n and k, namely (18). Moreover, (20) implies that the inverse Welch bound (5) for {ϕ j } n j=1 is…”
Section: Constructing Naimark Complements From Binders With Combinatomentioning
confidence: 99%
“…The claim follows by equating Equation (7) with Equation ( 10), replacing the inner product with the value given in Equation ( 15), and then rearranging to the desired form.…”
Section: Hsmentioning
confidence: 99%