Group-theoretic constructions of erasure-robust frames
  In the field of compressed sensing, a key problem remains open: to explicitly construct matrices with the restricted isometry property (RIP) whose performance rivals those generated using random matrix theory. In short, RIP involves estimating the singular values of a combinatorially large number of submatrices, seemingly requiring an enormous amount of computation in even low-dimensional examples. In this paper, we consider a similar problem involving submatrix singular value estimation, namely the problem of explicitly constructing numerically erasure robust frames (NERFs). Such frames are the latest invention in a long line of research concerning the design of linear encoders that are robust against data loss. We begin by focusing on a subtle difference between the definition of a NERF and that of an RIP matrix, one that allows us to introduce a new computational trick for quickly estimating NERF bounds. In short, we estimate these bounds by evaluating the frame analysis operator at every point of an epsilon-net for the unit sphere. We then borrow ideas from the theory of group frames to construct explicit frames and epsilon-nets with such high degrees of symmetry that the requisite number of operator evaluations is greatly reduced. We conclude with numerical results, using these new ideas to quickly produce decent estimates of NERF bounds which would otherwise take an eternity. Though the more important RIP problem remains open, this work nevertheless demonstrates the feasibility of exploiting symmetry to greatly reduce the computational burden of similar combinatorial linear algebra problems. 
Matthew Fickus, John Jasper, Dustin G. Mixon, Jesse Peterson
math.FA