What is odd about binary Parseval frames?
From MaRDI portal
Publication:1684509
DOI10.2140/involve.2018.11.219zbMath1379.42016arXiv1507.06860OpenAlexW1001482627MaRDI QIDQ1684509
Zachery J. Baker, Bernhard G. Bodmann, Samantha N. Branum, Jacob E. McLaney, Micah G. Bullock
Publication date: 11 December 2017
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06860
Gram-Schmidt orthogonalizationframesGram matricesfinite-dimensional vector spacesParseval framesbinary numbersswitching equivalencebinary cyclic framebinary Parseval frameNaimark complementorthogonal extension principle
Related Items (2)
Binary Parseval frames from group orbits ⋮ Binary frames with prescribed dot products and frame operator
Cites Work
- Unnamed Item
- Unnamed Item
- Binary frames, graphs and erasures
- Frame theory for binary vector spaces
- Optimal frames for erasures.
- Binary codes of strongly regular graphs
- Frames, graphs and erasures
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
- Equivalence relations and distances between Hilbert frames
- Frames, bases and group representations
- Performance analysis and recursive syndrome decoding of DFT codes for bursty erasure recovery
- Frame-Theoretic Analysis of DFTCodes With Erasures
- A Class of Nonharmonic Fourier Series
- Quantized frame expansions with erasures
This page was built for publication: What is odd about binary Parseval frames?
