Strengthening hash families and compressive sensing
From MaRDI portal
Publication:1932362
DOI10.1016/j.jda.2012.04.004zbMath1257.68112MaRDI QIDQ1932362
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
Publication date: 18 January 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.004
compressive sensing; Lovász local lemma; hash family; column replacement; Stein-Lovász-Johnson theorem
Related Items
Randomized Post-optimization for t-Restrictions, A hierarchical framework for recovery in compressive sensing, An asymptotic existence result on compressed sensing matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The restricted isometry property and its implications for compressed sensing
- A bound on the size of separating hash families
- Combinatorial sublinear-time Fourier algorithms
- Explicit construction of exponential sized families of k-independent sets
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Perfect hashing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Adaptive versus nonadaptive attribute-efficient learning
- Two combinatorial covering theorems
- The Lovász local lemma and its applications to some combinatorial arrays
- Improving two recursive constructions for covering arrays
- Bounds for separating hash families
- Deterministic constructions of compressed sensing matrices
- On generalized separating hash families
- A survey of combinatorial testing
- Compressed sensing and best 𝑘-term approximation
- Efficient Conditional Expectation Algorithms for Constructing Hash Families
- On greedy algorithms in coding theory
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Sparse representations in unions of bases
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Combinatorial Algorithms for Compressed Sensing
- Constructing Perfect Hash Families Using a Greedy Algorithm
- A Greedy Heuristic for the Set-Covering Problem
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- A generalized uncertainty principle and sparse representation in pairs of bases
- Sparse Approximate Solutions to Linear Systems
- Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
- On a combinatorial game
