Real, Tight Frames with Maximal Robustness to Erasures
DCC '05 Proceedings of the Data Compression Conference
Sparse fusion frames: existence and construction
Advances in Computational Mathematics
IEEE Transactions on Signal Processing
Priority encoding transmission
IEEE Transactions on Information Theory - Part 1
Capacity of wireless erasure networks
IEEE Transactions on Information Theory
Decoherence-Insensitive Quantum Communication by Optimal -Encoding
IEEE Transactions on Information Theory
Sparse Recovery From Combined Fusion Frame Measurements
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We investigate decompositions of positive matrices as weighted sums of orthogonal projections, and apply them to the construction of fusion frames when fusion frame operators are prescribed. Examples are provided to demonstrate the simplicity and flexibility in this practical construction of fusion frames. As an application, we provide an method constructing Parseval fusion frames that are optimal for the one packet erasure problem.