scientific article; zbMATH DE number 5764871

MaRDI QIDQ3579464zbMATH OpenFDO

Authors Piotr Indyk

Publication date 6 August 2010

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(14)

• The Shannon total variation
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
• Deterministic construction of compressed sensing matrices from constant dimension codes
• Deterministic constructions of compressed sensing matrices based on codes
• Construction of sparse binary sensing matrices using set systems
• 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
• On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
• Flexible, efficient, and accurate tests for epidemics
• From linear system of equations to artificial intelligence -- the evolution journey of computer tomographic image reconstruction algorithms
• Combinatorial sublinear-time Fourier algorithms
• Deterministic \(k\)-set structure
• A note on compressed sensing and the complexity of matrix multiplication

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)