scientific article; zbMATH DE number 5764871
From MaRDI portal
Publication:3579464
zbMATH Open1192.94045MaRDI QIDQ3579464FDOQ3579464
Authors: Piotr Indyk 
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (13)
- Deterministic \(k\)-set structure
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
- Construction of sparse binary sensing matrices using set systems
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
- Combinatorial sublinear-time Fourier algorithms
- A note on compressed sensing and the complexity of matrix multiplication
- Polynomial data structure lower bounds in the group model
- Deterministic construction of compressed sensing matrices from constant dimension codes
- Flexible, efficient, and accurate tests for epidemics
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Deterministic construction of compressed sensing matrices with characters over finite fields
- The Shannon total variation
- Deterministic constructions of compressed sensing matrices based on codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579464)
