Numerically erasure-robust frames
From MaRDI portal
Publication:442671
Abstract: Given a channel with additive noise and adversarial erasures, the task is to design a frame that allows for stable signal reconstruction from transmitted frame coefficients. To meet these specifications, we introduce numerically erasure-robust frames. We first consider a variety of constructions, including random frames, equiangular tight frames and group frames. Later, we show that arbitrarily large erasure rates necessarily induce numerical instability in signal reconstruction. We conclude with a few observations, including some implications for maximal equiangular tight frames and sparse frames.
Recommendations
Cites work
- A simple proof of the restricted isometry property for random matrices
- A survey of finite algebraic geometrical structures underlying mutually unbiased quantum measurements
- Achieving the Welch Bound With Difference Sets
- Complex sequences with low periodic correlations (Corresp.)
- Decoding by Linear Programming
- Equal-norm tight frames with erasures
- Finite normalized tight frames
- Fourier transforms of finite chirps
- Full spark frames
- Grassmannian frames with applications to coding and communication
- Local operator theory, random matrices and Banach spaces.
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- On sparse reconstruction from Fourier and Gaussian measurements
- On the construction of equiangular frames from graphs
- Optimal frames for erasures.
- Optimally Sparse Frames
- Painless reconstruction from magnitudes of frame coefficients
- Quantized frame expansions with erasures
- Sparse fusion frames: existence and construction
- Steiner equiangular tight frames
- Symmetric informationally complete–positive operator valued measures and the extended Clifford group
- The restricted isometry property and its implications for compressed sensing
- The road to deterministic matrices with the restricted isometry property
- Tight frames and their symmetries
Cited in
(22)- Construction of robust frames in erasure recovery
- Erasures and equalities for fusion frames in Hilbert spaces
- Group-theoretic constructions of erasure-robust frames
- Frame potentials and the geometry of frames
- Saving phase: injectivity and stability for phase retrieval
- Frame scalings: a condition number approach
- Frames as codes
- Probability modelled optimal frames for erasures
- Optimal Parseval frames: total coherence and total volume
- Full-spark frames arising from one-parameter groups
- Maximum robustness and surgery of frames in finite dimensions
- scientific article; zbMATH DE number 6531447 (Why is no real title available?)
- Quantized frame expansions with erasures
- On 6× 6 complex Hadamard matrices containing two nonintersecting identical 3× 3 submatrices
- Frame-Theoretic Analysis of Robust Filter Bank Frames to Quantization and Erasures
- Robustness properties of dimensionality reduction with Gaussian random matrices
- Erasure recovery matrices for encoder protection
- Signal recovery and frames that are robust to erasure
- Stability bounds for reconstruction from sampling erasures
- A strong restricted isometry property, with an application to phaseless compressed sensing
- Random matrices and erasure robust frames
- Perturbation and construction of almost self‐located robust frames with applications to erasure recovery
This page was built for publication: Numerically erasure-robust frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442671)
