Simple Codes and Sparse Recovery with Fast Decoding
From MaRDI portal
Publication:6101016
DOI10.1137/21m1465354arXiv1901.02852OpenAlexW2910453765MaRDI QIDQ6101016
João L. Ribeiro, Mahdi Cheraghchi
Publication date: 31 May 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.02852
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Noise-resilient group testing: limitations and constructions
- Lossless condensers, unbalanced expanders, and extractors
- Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications
- Expander codes
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- Randomness conductors and constant-degree lossless expanders
- Combinatorial Algorithms for Compressed Sensing
- Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
- For-All Sparse Recovery in Near-Optimal Time
- Efficient and Robust Compressed Sensing Using Optimized Expander Graphs
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
- SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing Based on Sparse-Graph Codes
- Advances in Cryptology - EUROCRYPT 2004
This page was built for publication: Simple Codes and Sparse Recovery with Fast Decoding
