scientific article
From MaRDI portal
Publication:3579464
zbMath1192.94045MaRDI QIDQ3579464
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items (12)
Deterministic construction of compressed sensing matrices with characters over finite fields ⋮ Polynomial Data Structure Lower Bounds in the Group Model ⋮ Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ Deterministic construction of compressed sensing matrices from constant dimension codes ⋮ The Shannon total variation ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ Deterministic \(k\)-set structure ⋮ A note on compressed sensing and the complexity of matrix multiplication ⋮ Construction of Sparse Binary Sensing Matrices Using Set Systems ⋮ Deterministic constructions of compressed sensing matrices based on codes ⋮ On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
This page was built for publication:
