Grassmannian codes from paired difference sets
From MaRDI portal
Publication:2234467
Abstract: An equiangular tight frame (ETF) is a sequence of vectors in a Hilbert space that achieves equality in the Welch bound and so has minimal coherence. More generally, an equichordal tight fusion frame (ECTFF) is a sequence of equi-dimensional subspaces of a Hilbert space that achieves equality in Conway, Hardin and Sloane's simplex bound. Every ECTFF is a type of optimal Grassmannian code, that is, an optimal packing of equi-dimensional subspaces of a Hilbert space. We construct ECTFFs by exploiting new relationships between known ETFs. Harmonic ETFs equate to difference sets for finite abelian groups. We say that a difference set for such a group is "paired" with a difference set for its Pontryagin dual when the corresponding subsequence of its harmonic ETF happens to be an ETF for its span. We show that every such pair yields an ECTFF. We moreover construct an infinite family of paired difference sets using quadratic forms over the field of two elements. Together this yields two infinite families of real ECTFFs.
In this paper, the authors construct equichordal tight fusion frames (abbreviated ECTFF) by exploiting new relationships between known equiangular tight frames (abbreviated ETF). Also, paired difference sets for finite abelian groups are defined using the concept of the tightness of a frame. Indeed, a difference set for a finite abelian group is paired with a difference set for its Pontryagin dual when the corresponding subsequence of its harmonic ETF happens to be an ETF for its span. It is also shown that a harmonic ETF that arises from such a pair contains many overlapping, unitarily equivalent copies of a smaller ETF and the spans of these copies form an ECTFF. Moreover, the authors exploit quadratic forms over the field of two elements to construct an infinite family of paired difference sets and two infinite families of real ECTFFs. Finally, some open problems concerning the existence of paired difference sets are presented.
Recommendations
- Equidistant codes in the Grassmannian
- Duadic codes and difference sets
- A bound on Grassmannian codes
- Codes from difference sets
- The structure of dual Grassmann codes
- scientific article; zbMATH DE number 1009714
- Grassmann codes and Schubert unions
- The Asymptotic Behavior of Grassmannian Codes
- An application of difference sets to a problem concerning graphical codes
- Duals of Affine Grassmann Codes and Their Relatives
Cites work
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- A group-theoretic framework for the construction of packings in Grassmannian spaces
- Achieving the Welch Bound With Difference Sets
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Character sums and difference sets
- Codes and designs in Grassmannian spaces.
- Combinatorial constructions of packings in Grassmannian spaces
- Complex conference matrices and equi-isoclinic planes in Euclidean spaces
- Complex equiangular Parseval frames and Seidel matrices containing 𝑝th roots of unity
- Constructing Packings in Grassmannian Manifolds via Alternating Projection
- Constructing subspace packings from other packings
- Constructing tight fusion frames
- Dimension towers of SICs. I: Aligned SICs and embedded tight frames
- Distance regular graphs of diameter 3 and strongly regular graphs
- Equiangular lines and covers of the complete graph
- Equiangular Tight Frames From Hyperovals
- Equiangular tight frames that contain regular simplices
- Equiangular tight frames with centroidal symmetry
- Families of optimal packings in real and complex Grassmannian spaces
- Finite two-distance tight frames
- Grassmannian frames with applications to coding and communication
- Harmonic equiangular tight frames comprised of regular simplices
- scientific article; zbMATH DE number 5130692 (Why is no real title available?)
- scientific article; zbMATH DE number 54047 (Why is no real title available?)
- scientific article; zbMATH DE number 1421280 (Why is no real title available?)
- scientific article; zbMATH DE number 3428111 (Why is no real title available?)
- scientific article; zbMATH DE number 3407684 (Why is no real title available?)
- Infinite family of equi-isoclinic planes in Euclidean odd dimensional spaces and of complex symmetric conference matrices of odd orders
- Kirkman Equiangular Tight Frames and Codes
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Maximally equiangular frames and Gauss sums
- New sets of equi-isoclinic n-planes from old
- On block coherence of frames
- On the construction of equiangular frames from graphs
- Optimal arrangements of classical and quantum states with limited purity
- Optimal frames for erasures.
- OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS
- Optimal linear transmission by loss-insensitive packet encoding
- Optimal simplices and codes in projective spaces
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Polyphase equiangular tight frames and abelian generalized quadrangles
- QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY
- Quaternionic equiangular lines
- Robust dimension reduction, fusion frames, and Grassmannian packings
- Steiner equiangular tight frames
- Strongly Regular Graphs Derived from Combinatorial Designs
- Symmetric informationally complete quantum measurements
- The road to deterministic matrices with the restricted isometry property
- Tight p-fusion frames
- Tremain equiangular tight frames
- Two are better than one: fundamental parameters of frame coherence
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
Cited in
(10)- An application of difference sets to a problem concerning graphical codes
- Combinatorial constructions of packings in Grassmannian spaces
- On the value of the fifth maximal projection constant
- Harmonic equiangular tight frames comprised of regular simplices
- Harmonic Grassmannian codes
- Naimark-spatial families of equichordal tight fusion frames
- The real equiangular tight frames obtained from rank 3 graphs
- Testing isomorphism between tuples of subspaces
- Declipping and the recovery of vectors from saturated measurements
- Doubly transitive equiangular tight frames that contain regular simplices
This page was built for publication: Grassmannian codes from paired difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234467)
