Binary frames, graphs and erasures (Q394124): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.2140/involve.2014.7.151 / rank
Normal rank
 
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.2140/involve.2014.7.151 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027610851 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2140/INVOLVE.2014.7.151 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:14, 9 December 2024

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

    Statements

    Binary frames, graphs and erasures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 January 2014
    0 references
    The objects of study in this paper are Parseval frames for binary vector spaces. The authors present necessary and sufficient conditions under which binary Parseval frames can be robust to erasures. The conditions are given in terms of the associated Gram matrix. Further, by interpreting the Gram matrix as the adjacency matrix of a graph, a reformulation of the conditions for robustness to erasures is given in graph theoretic terms.
    0 references
    frames
    0 references
    Parseval frames
    0 references
    finite-dimensional vector spaces
    0 references
    binary numbers
    0 references
    codes
    0 references
    switching equivalence
    0 references
    Gram matrix
    0 references
    adjacency matrix
    0 references
    graphs
    0 references

    Identifiers