Binary frames, graphs and erasures

DOI10.2140/INVOLVE.2014.7.151MaRDI QIDQ394124zbMATH OpenOpenAlexFDO

Authors Bernhard G. Bodmann, Bijan Camp, Dax Mahoney

Publication date 24 January 2014

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2014.7.151

zbMATH Keywords

adjacency matrixbinary numberscodesfinite-dimensional vector spacesframesGram matrixgraphsParseval framesswitching equivalence

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15)

Review text

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.

Recommendations

• Frames, graphs and erasures
• Frame theory for binary vector spaces
• Binary Parseval frames from group orbits
• Optimal frames for erasures.
• Frames as codes

Cited in

(7)

• Binary Parseval frames from group orbits
• What is odd about binary Parseval frames?
• Binary frames with prescribed dot products and frame operator
• Random matrices and erasure robust frames
• Group-theoretic constructions of erasure-robust frames
• Frames, graphs and erasures
• Dual finite frames for vector spaces over an arbitrary field with applications

This page was built for publication: Binary frames, graphs and erasures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394124)