{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q394124","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q394124","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q394124","kernelVersion":"v1","immutable":true,"modified":"2026-01-20T12:54:28Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q394124","name":"Binary frames, graphs and erasures","headline":"Binary frames, graphs and erasures","description":"scientific article; zbMATH DE number 6250329","url":"https://portal.mardi4nfdi.de/entity/Q394124","datePublished":"2014-01-24","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q331151"},{"@id":"https://portal.mardi4nfdi.de/entity/Q394122"},{"@id":"https://portal.mardi4nfdi.de/entity/Q394123"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q258627"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.2140/INVOLVE.2014.7.151","url":"https://doi.org/10.2140/INVOLVE.2014.7.151"},"sameAs":["https://doi.org/10.2140/INVOLVE.2014.7.151"],"comment":"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."},"provenance":{"prov:generatedAtTime":"2026-01-20T12:54:28Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}