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