Frames, graphs and erasures (Q2484389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3880871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal-norm tight frames with erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Matrices with Zero Diagonal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular two-graph on 276 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantized frame expansions with erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal frames for erasures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orthogonal Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4121914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grassmannian frames with applications to coding and communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard's determinant theorem and the sum of four squares / rank
 
Normal rank

Revision as of 12:42, 10 June 2024

scientific article
Language Label Description Also known as
English
Frames, graphs and erasures
scientific article

    Statements

    Frames, graphs and erasures (English)
    0 references
    0 references
    0 references
    1 August 2005
    0 references
    frames
    0 references
    codes
    0 references
    erasures
    0 references
    graphs
    0 references
    two-graphs
    0 references
    Hadamard matrix
    0 references
    conference matrix
    0 references
    error bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references