Strengthening hash families and compressive sensing
type: Item
instance of: scholarly article
title: Strengthening hash families and compressive sensing
zbMATH Open document ID: 1257.68112
author: Charles J. Colbourn
author: Daniel Horsley
author: Violet R. Syrotiuk
published in: Journal of Discrete Algorithms
publication date: 2013-01-18T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 6126825
zbMATH Keywords: compressive sensing
zbMATH Keywords: hash family
zbMATH Keywords: column replacement
zbMATH Keywords: Stein-Lovász-Johnson theorem
zbMATH Keywords: Lovász local lemma
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: j.jda.2012.04.004
OpenAlex ID: W2083171863
cites work: Explicit construction of exponential sized families of k-independent sets
cites work: Bounds for separating hash families
cites work: Q4536823
cites work: A bound on the size of separating hash families
cites work: Q5491042
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Decoding by Linear Programming
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: Q5417683
cites work: Atomic Decomposition by Basis Pursuit
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Compressed sensing and best 𝑘-term approximation
cites work: On greedy algorithms in coding theory
cites work: Constructing Perfect Hash Families Using a Greedy Algorithm
cites work: Q3195092
cites work: Efficient Conditional Expectation Algorithms for Constructing Hash Families
cites work: Q3000893
cites work: Improving two recursive constructions for covering arrays
cites work: Combinatorial Algorithms for Compressed Sensing
cites work: Perfect hashing
cites work: Adaptive versus nonadaptive attribute-efficient learning
cites work: The Lovász local lemma and its applications to some combinatorial arrays
cites work: Deterministic constructions of compressed sensing matrices
cites work: Uncertainty principles and ideal atomic decomposition
cites work: Q4857782
cites work: A generalized uncertainty principle and sparse representation in pairs of bases
cites work: Q4074927
cites work: On a combinatorial game
cites work: On Sparse Representations in Arbitrary Redundant Bases
cites work: Recovery of Exact Sparse Representations in the Presence of Bounded Noise
cites work: Q3549618
cites work: Sparse representations in unions of bases
cites work: Combinatorial sublinear-time Fourier algorithms
cites work: Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
cites work: Approximation algorithms for combinatorial problems
cites work: Q4142699
cites work: On the ratio of optimal integral and fractional covers
cites work: Q3219751
cites work: Q4856179
cites work: Sparse Approximate Solutions to Linear Systems
cites work: A survey of combinatorial testing
cites work: Two combinatorial covering theorems
cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
cites work: On generalized separating hash families
cites work: Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization
DOI: 10.1016/J.JDA.2012.04.004
description: scientific article; zbMATH DE number 6126825