Kirkman Equiangular Tight Frames and Codes

DOI10.1109/TIT.2013.2285565zbMATH Open1364.42036arXiv1306.3111OpenAlexW1998831922MaRDI QIDQ5346152FDOQ5346152

Authors: John Jasper, Dustin G. Mixon, Matthew Fickus 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: An equiangular tight frame (ETF) is a set of unit vectors in a Euclidean space whose coherence is as small as possible, equaling the Welch bound. Also known as Welch-bound-equality sequences, such frames arise in various applications, such as waveform design and compressed sensing. At the moment, there are only two known flexible methods for constructing ETFs: harmonic ETFs are formed by carefully extracting rows from a discrete Fourier transform; Steiner ETFs arise from a tensor-like combination of a combinatorial design and a regular simplex. These two classes seem very different: the vectors in harmonic ETFs have constant amplitude, whereas Steiner ETFs are extremely sparse. We show that they are actually intimately connected: a large class of Steiner ETFs can be unitarily transformed into constant-amplitude frames, dubbed Kirkman ETFs. Moreover, we show that an important class of harmonic ETFs is a subset of an important class of Kirkman ETFs. This connection informs the discussion of both types of frames: some Steiner ETFs can be transformed into constant-amplitude waveforms making them more useful in waveform design; some harmonic ETFs have low spark, making them less desirable for compressed sensing. We conclude by showing that real-valued constant-amplitude ETFs are equivalent to binary codes that achieve the Grey-Rankin bound, and then construct such codes using Kirkman ETFs.

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Application of orthogonal and other special functions (94A11)

Cited In (24)

• Linked systems of symmetric designs
• Grassmannian codes from paired difference sets
• Doubly transitive lines. I: Higman pairs and roux
• Packings in real projective spaces
• DCACO: an algorithm for designing incoherent redundant matrices
• Equiangular tight frames from group divisible designs
• Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
• Properties of real and complex ETFs and their application to the design of low coherence frames
• Harmonic equiangular tight frames comprised of regular simplices
• Spark deficient Gabor frames
• On block coherence of frames
• Equiangular lines and covers of the complete graph
• Achieving the orthoplex bound and constructing weighted complex projective 2-designs with Singer sets
• Polyphase equiangular tight frames and abelian generalized quadrangles
• A survey of compressed sensing
• Optimal arrangements of classical and quantum states with limited purity
• Hadamard equiangular tight frames
• Equiangular tight frames and unistochastic matrices
• On the value of the fifth maximal projection constant
• Equiangular lines and the Lemmens-Seidel conjecture
• A notion of optimal packings of subspaces with mixed-rank and solutions
• Equiangular tight frames that contain regular simplices
• Equiangular tight frames with centroidal symmetry
• Constructions of biangular tight frames and their relationships with equiangular tight frames

This page was built for publication: Kirkman Equiangular Tight Frames and Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346152)