Explicit universal sampling sets in finite vector spaces

DOI10.1016/j.acha.2016.06.001zbMath1380.94060arXiv1507.06849OpenAlexW2205098157MaRDI QIDQ2399652

Lucia Morotti

Publication date: 24 August 2017

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06849

zbMATH Keywords

Fourier analysisfinite vector spacescompressed sensing

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (10)

High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees ⋮ A deterministic sparse FFT for functions with structured Fourier sparsity ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time ⋮ A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ The uniform sparse FFT with application to PDEs with random coefficients ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• Explicit constructions of RIP matrices and related problems
• Combinatorial sublinear-time Fourier algorithms
• Deterministic constructions of compressed sensing matrices
• On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
• On sparse reconstruction from Fourier and Gaussian measurements
• Decoding by Linear Programming
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Explicit universal sampling sets in finite vector spaces