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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
