No article text was recorded for this version.
explicit matrix construction
Version 2 of 265 papers88 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing
- Blog: LDPC Codes for Compressed Sensing
- Blog: Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
- Blog: On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
- Blog: Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
- Blog: Vanishingly Sparse Matrices and Expander Graphs, with application to compressed sensing
- Blog: Combining geometry and combinatorics: A unified approach to sparse signal recovery
- Blog: Deterministic constructions of binary measurement matrices with various sizes
- Blog: Polarization of the Rényi Information Dimension for Single and Multi Terminal Analog Compression
- Blog: Superset Technique for Approximate Recovery in One-Bit Compressed Sensing
- Blog: Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
- Blog: Group Testing with Blocks of Positives and Inhibitors
- Blog: Deterministic Sequences for Compressive MIMO Channel Estimation
- Blog: Model-based Sketching and Recovery with Expanders
- Blog: Improved Bounds for Universal One-Bit Compressive Sensing
- Blog: A Class of Deterministic Sensing Matrices and Their Application in Harmonic Detection
- Blog: Spaceability of Functions with Complicated Quantization and Truncation Behavior
- Blog: Deterministic constructions of binary measurement matrices with various sizes
- Blog: Derandomizing Compressed Sensing With Combinatorial Design
- Blog: Sparks and Deterministic Constructions of Binary Measurement Matrices from Finite Geometry
- Blog: Pseudo-Wigner Matrices from Dual BCH Codes
- Blog: Low-Coherence Frames From Group Fourier Matrices
- Blog: Terracini convexity
- Blog: Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations
- Blog: Efficient (nonrandom) Construction and Decoding for Non-adaptive Group Testing
- Blog: Group Frames With Few Distinct Inner Products and Low Coherence
- Blog: On the construction of sparse matrices from expander graphs
- Blog: Polarization of the Rényi Information Dimension With Applications to Compressed Sensing
- Blog: Strongly separable matrices for nonadaptive combinatorial group testing
- Blog: Improvement of Dirichlet Observation Matrix based on Super Prime Numbers
- Blog: Single-Pixel Color Imaging Method with a Compressive Sensing Measurement Matrix
- Blog: On group coherence of frames
- Blog: Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
- Blog: High-Girth Matrices and Polarization
- Blog: The restricted isometry property for time-frequency structured random matrices
- Blog: Deterministic Heavy Hitters with Sublinear Query Time
- Blog: Compressed Sensing for Wireless Communications: Useful Tips and Tricks
- Blog: LDPC Codes for Compressed Sensing
- Blog: The Average-Case Time Complexity of Certifying the Restricted Isometry Property
- Blog: Inverting Spectrogram Measurements via Aliased Wigner Distribution Deconvolution and Angular Synchronization
- Blog: Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
- Blog: Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs
- Blog: Estimation of Sparsity via Simple Measurements
- Blog: On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation
- Blog: Convolutional Compressed Sensing Using Deterministic Sequences
- Blog: Compressed Sensing: Theory and Applications
- Blog: Modulated Unit-Norm Tight Frames for Compressed Sensing
- Blog: Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
- Blog: Restricted isometry property of random subdictionaries
- Blog: Construction of Structured Random Measurement Matrices in Semi-Tensor Product Compressed Sensing Based on Combinatorial Designs
- Blog: Oblivious near-optimal sampling for multidimensional signals with Fourier constraints
- Blog: Sensing Matrix Design and Sparse Recovery on the Sphere and the Rotation Group
- Blog: Uncertainty Relations and Sparse Signal Recovery for Pairs of General Signal Sets
- Blog: What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?
- Blog: Phase Retrieval for Sparse Signals
- Blog: Compressed Sensing for Wireless Communications: Useful Tips and Tricks
- Blog: Compressive sensing using locality-preserving matrices
- Blog: Measurement Matrix Design for Phase Retrieval Based on Mutual Information
- Blog: TomoPIV Meets Compressed Sensing
- Blog: Reconstruction guarantee analysis of binary measurement matrices based on girth
Showing 60 of 65 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_explicit_matrix_construction_ad36dc97,
title = {explicit matrix construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/explicit-matrix-construction/rdr_ad36dc97ea1b402bb010f6f8ff109b28},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_explicit_matrix_construction_ad36dc97_v2,
title = {explicit matrix construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/explicit-matrix-construction/rdr_ad36dc97ea1b402bb010f6f8ff109b28/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}