Optimal frames for erasures. (Q1418965): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2003.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072565885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYMMETRIC HADAMARD MATRICES OF ORDER 36 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal-norm tight frames with erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Lines, Planes, etc.: Packings in Grassmannian Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite normalized tight frames / 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: The Pythagorean Theorem: I. The finite case / 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

Latest revision as of 13:51, 6 June 2024

scientific article
Language Label Description Also known as
English
Optimal frames for erasures.
scientific article

    Statements

    Optimal frames for erasures. (English)
    0 references
    0 references
    0 references
    14 January 2004
    0 references
    A numerical measure of how well a frame reconstructs vectors when some of the frame coefficients of a vector are lost is introduced. Then the frames that are optimal in this setting are classified. Applications are in coding theory.
    0 references
    0 references
    0 references
    0 references
    0 references
    frame
    0 references
    erasures
    0 references
    0 references
    0 references