What is odd about binary Parseval frames?

DOI10.2140/INVOLVE.2018.11.219MaRDI QIDQ1684509zbMATH OpenOpenAlexFDO

Authors Zachery J. Baker, Bernhard G. Bodmann, Micah G. Bullock, Samantha N. Branum, Jacob E. McLaney

Publication date 11 December 2017

Published in Involve (Search for Journal in Brave)

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

zbMATH Keywords

binary cyclic framebinary numbersbinary Parseval framefinite-dimensional vector spacesframesGram matricesGram-Schmidt orthogonalizationNaimark complementorthogonal extension principleParseval framesswitching equivalence

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15)

Abstract: This paper examines the construction and properties of binary Parseval frames. We address two questions: When does a binary Parseval frame have a complementary Parseval frame? Which binary symmetric idempotent matrices are Gram matrices of binary Parseval frames? In contrast to the case of real or complex Parseval frames, the answer to these questions is not always affirmative. The key to our understanding comes from an algorithm that constructs binary orthonormal sequences that span a given subspace, whenever possible. Special regard is given to binary frames whose Gram matrices are circulants.

Review text

The present paper is concerned with binary Parseval frames. These binary frames provide explicit expansions of binary vectors using a bilinear form that resembles the dot product in Euclidean spaces. In contrast to the inner product on real or complex Hilbert spaces, there are many nonzero vectors whose dot product with themselves vanishes. Such vectors have special significance in the paper results. Due to the number of nonzero entries they contain, we call them even vectors, and if a vector is not even, we call it odd. As a consequence of the degeneracy of the bilinear form, there are some striking differences with frame theory over real or complex Hilbert spaces. In this paper, the authors explore the construction and properties of binary Parseval frames, and compare them with real and complex ones. Their main results are as follows. In the real or complex case, it is known that each Parseval frame has a Naimark complement. The complementarity is most easily formulated by stating that the Gram matrices of two complementary Parseval frames sum to the identity. The paper shows that in the binary case, not every Parseval frame has a Naimark complement. It also shows that a necessary and sufficient condition for its existence is that the Parseval frame contains at least one even vector. Moreover, the authors study the structure of Gram matrices. The Gram matrices of real or complex Parseval frames are characterized as symmetric or hermitian idempotent matrices. The binary case requires the additional condition that at least one column vector of the matrix is odd.

Recommendations

• Binary Parseval frames from group orbits
• Binary frames with prescribed dot products and frame operator
• On representation of Parseval frames
• Parseval frames with \(n + 1\) vectors in \(\mathbb{R}^{n}\)
• Parseval frames and the discrete Walsh transform
• On Parseval J-frames
• Frame theory for binary vector spaces
• Existence of Parseval oblique duals of a frame sequence
• Parseval p-frames and the Feichtinger conjecture
• scientific article; zbMATH DE number 427788

Cites work

• A Class of Nonharmonic Fourier Series
• Binary codes of strongly regular graphs
• Binary frames
• Binary frames, graphs and erasures
• Equivalence relations and distances between Hilbert frames
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• Frame theory for binary vector spaces
• Frame-Theoretic Analysis of DFTCodes With Erasures
• Frames, bases and group representations
• Frames, graphs and erasures
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Matrix Factorization over GF(2) and Trace-Orthogonal Bases of GF(2ⁿ )
• Optimal frames for erasures.
• Performance analysis and recursive syndrome decoding of DFT codes for bursty erasure recovery
• Quantized frame expansions with erasures

Cited in

(5)

• Binary Parseval frames from group orbits
• Binary frames with prescribed dot products and frame operator
• Binary frames
• Parseval transforms for finite frames
• Necessary and sufficient conditions for prime Parseval frames

This page was built for publication: What is odd about binary Parseval frames?

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