Numerically erasure-robust frames
From MaRDI portal
Publication:442671
DOI10.1016/j.laa.2012.04.034zbMath1256.94019arXiv1202.4525OpenAlexW2963597099MaRDI QIDQ442671
Dustin G. Mixon, Matthew Fickus
Publication date: 3 August 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4525
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Conditioning of matrices (15A12)
Related Items
Stability bounds for reconstruction from sampling erasures ⋮ Full-spark frames arising from one-parameter groups ⋮ Maximum robustness and surgery of frames in finite dimensions ⋮ Frame scalings: a condition number approach ⋮ On 6× 6 complex Hadamard matrices containing two nonintersecting identical 3× 3 submatrices ⋮ Optimal Parseval frames: total coherence and total volume ⋮ Frame potentials and the geometry of frames ⋮ A strong restricted isometry property, with an application to phaseless compressed sensing ⋮ Robustness properties of dimensionality reduction with Gaussian random matrices ⋮ Random matrices and erasure robust frames ⋮ Saving phase: injectivity and stability for phase retrieval ⋮ Erasure recovery matrices for encoder protection ⋮ Group-theoretic constructions of erasure-robust frames ⋮ Signal recovery and frames that are robust to erasure ⋮ Erasures and equalities for fusion frames in Hilbert spaces
Cites Work
- Unnamed Item
- The road to deterministic matrices with the restricted isometry property
- Sparse fusion frames: existence and construction
- Steiner equiangular tight frames
- On the construction of equiangular frames from graphs
- A survey of finite algebraic geometrical structures underlying mutually unbiased quantum measurements
- Fourier transforms of finite chirps
- The restricted isometry property and its implications for compressed sensing
- A simple proof of the restricted isometry property for random matrices
- Painless reconstruction from magnitudes of frame coefficients
- Grassmannian frames with applications to coding and communication
- Optimal frames for erasures.
- Tight frames and their symmetries
- Finite normalized tight frames
- Equal-norm tight frames with erasures
- Full spark frames
- Symmetric informationally complete–positive operator valued measures and the extended Clifford group
- On sparse reconstruction from Fourier and Gaussian measurements
- Decoding by Linear Programming
- Achieving the Welch Bound With Difference Sets
- Complex sequences with low periodic correlations (Corresp.)
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Optimally Sparse Frames
- Quantized frame expansions with erasures
This page was built for publication: Numerically erasure-robust frames
