arXiv (All)
open access
Compressed sensing with combinatorial designs: theory and simulations
In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use deterministic and probabilistic methods to analyse the performance of matrices obtained from this construction. We prov
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Compressed Sensing - A New mode of Measurement#775852
- An asymptotic existence result on compressed sensing matrices#1413430
- A Walk From Free Probability to Matrix Discrepancy I: Matrix Spencer#1013071
- Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time#677445
- Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time#674248
Record · ID 1413433
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive