Random matrices and erasure robust frames (Q1704861): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: PhaseLift / rank
 
Normal rank

Revision as of 18:42, 29 February 2024

scientific article
Language Label Description Also known as
English
Random matrices and erasure robust frames
scientific article

    Statements

    Random matrices and erasure robust frames (English)
    0 references
    0 references
    13 March 2018
    0 references
    This paper addresses the issue of robustness against erasures of finite frames. The frames considered are random frames, namely \(F=\frac{1}{\sqrt n}A\) where \(A\) is \(n\times N\) whose entries are independent Gaussian random variables of \({\mathcal N}(0,1)\) distribution. They show that such frames are robust against erasures as long as the number of the remaining vectors (vectors left after removing few columns of \(F\) ) is at least \((1+\delta_0)n\) for some \(\delta_0.\) They show that robustness with more than 50\% erasures can be achieved, in fact it can be as close as 100 \%. Since the frame consists of random numbers, the robustness against erasures is probability based. They are of very high probability. Examples are provided.
    0 references
    random matrices
    0 references
    singular values
    0 references
    numerically erasure robust frame
    0 references
    condition number
    0 references

    Identifiers