Binary frames, graphs and erasures (Q394124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Binary frames, graphs and erasures |
scientific article; zbMATH DE number 6250329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary frames, graphs and erasures |
scientific article; zbMATH DE number 6250329 |
Statements
Binary frames, graphs and erasures (English)
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
0.8458250761032104
0 references
0.8087885975837708
0 references
0.804852306842804
0 references
0.8030365109443665
0 references
