Construction of Sparse Binary Sensing Matrices Using Set Systems (Q2801915): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-81-322-2485-3_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2403524361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable recovery of sparse overcomplete representations in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restricted isometry property and its implications for compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic constructions of compressed sensing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of RIP matrices and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the restricted isometry property for random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner equiangular tight frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing set systems with prescribed intersection sizes / rank
 
Normal rank

Latest revision as of 20:00, 11 July 2024

scientific article
Language Label Description Also known as
English
Construction of Sparse Binary Sensing Matrices Using Set Systems
scientific article

    Statements

    Construction of Sparse Binary Sensing Matrices Using Set Systems (English)
    0 references
    0 references
    22 April 2016
    0 references
    compressed sensing
    0 references
    restricted isometry property
    0 references
    deterministic construction
    0 references
    set systems
    0 references

    Identifiers