Efficiently decodable compressed sensing by list-recoverable codes and recursion

DOI10.4230/LIPICS.STACS.2012.230MaRDI QIDQ2904764zbMATH OpenFDO

Authors Ely Porat, Atri Rudra, Hung Q. Ngo

Publication date 23 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2012.230

zbMATH Keywords

compressed sensinglist-recoverable codessub-linear time decoding

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial Algorithms for Compressed Sensing
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
• Stronger _2/_2 compressed sensing; without iterating
• Deterministic construction of compressed sensing matrices from codes

Cited in

(10)

• On the ring-LWE and polynomial-LWE problems
• On data compression and recovery for sequences using constraints on the spectrum range
• Black-box Trace\&Revoke codes
• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• Local list recovery of high-rate tensor codes and applications
• On List Recovery of High-Rate Tensor Codes
• Stronger _2/_2 compressed sensing; without iterating
• scientific article; zbMATH DE number 7650135 (Why is no real title available?)
• Simple Codes and Sparse Recovery with Fast Decoding
• Unsourced random access

This page was built for publication: Efficiently decodable compressed sensing by list-recoverable codes and recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904764)