Weighted fusion frame construction via spectral tetris
From MaRDI portal
Publication:457687
DOI10.1007/s10444-013-9310-7zbMath1298.42034arXiv1207.4849OpenAlexW1980880311MaRDI QIDQ457687
Peter G. Casazza, Jesse D. Peterson
Publication date: 29 September 2014
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.4849
Related Items (3)
Frame scalings: a condition number approach ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ The Fundamentals of Spectral Tetris Frame Constructions
Cites Work
- Unnamed Item
- Constructing tight fusion frames
- Sparse fusion frames: existence and construction
- Spectral tetris fusion frame constructions
- Optimal linear transmission by loss-insensitive packet encoding
- Fusion frames and distributed processing
- The structure of minimizers of the frame potential on fusion frames
- Minimizing fusion frame potential
- Foundations of time-frequency analysis
- Necessary and sufficient conditions to perform spectral tetris
- Constructing finite frames of a given spectrum and set of lengths
- A combinatorial characterization of tight fusion frames
- Robust dimension reduction, fusion frames, and Grassmannian packings
This page was built for publication: Weighted fusion frame construction via spectral tetris