A new class of measurement operators, coined hierarchical and prove results guaranteeing the efficient, stable robust recovery hierarchically structured signals from such measurements. We derive bounds on their restricted isometry properties based constants constituent matrices, generalizing extending prior work Kronecker-product As an exemplary application, we apply theory to two communication...

Compressive Sampling (CS) describes a method for reconstructing high-dimensional sparse signals from a small number of linear measurements. Fundamental to the success of CS is the existence of special measurement matrices which satisfy the so-called Restricted Isometry Property (RIP). In essence, a matrix satisfying RIP is such that the lengths of all sufficiently sparse vectors are approximate...

The study of linear algebra has become more and more popular in the last few decades. People are attracted to this subject because of its beauty and its connections with many other pure and applied areas. In theoretical development of the subject as well as in many applications, one often needs to measure the “length” of vectors. For this purpose, norm functions are considered on a vector space...

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes, where these groups are the same, it is shown that for combinatorial codes the groups can be arbitrary different. Particularly, there exist codes with the fu...

A map T: Ej —► E2 (E|, E2 Banach spaces) is an e-isometry if III T(X) T(Y)\\ \\X Y\\ I < e whenever X, Ye Ex. The problem of uniformly approximating such maps by isometries was first raised by Hyers and Ulam in 1945 and subsequently studied for special infinite dimensional Banach spaces. This question is here broached for the class of finite dimensional Banach spaces. The only positive homogene...

Let X be a proper CAT(0)-space and let G be a closed subgroup of the isometry group Iso(X) of X. We show that if G is non-elementary and contains a rank-one element then its second bounded cohomology group with coefficients in the regular representation is non-trivial. As a consequence, up to passing to an open subgroup of finite index, either G is a compact extension of a totally disconnected ...

The restricted isometry condition. The proof that the Restricted Isometry Condition is sufficient for sparse recovery using convex programming is due to Candes and Tao [2]. A simpler proof, also due to Candes and Tao, is in [4]. Applications of restricted isometries to vector quantization and democratic coding are found in [10], and applications to computing the condition number of random matri...

Extending the well-known result that every fuzzy metric space, in the sense of Kramosil and Michalek, has a completion which is unique up to isometry, we show that every KM-fuzzy quasi-metric space has a bicompletion which is unique up to isometry, and deduce that for each KM-fuzzy quasi-metric space, the completion of its induced fuzzy metric space coincides with the fuzzy metric space induced...

Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm (i.e., Block OMP) outperforms the conventional OMP. In this paper, we demonstrate that a new notion of block restricted isometry property (Block RIP), which is ...

It is consistent with the axioms of set theory that for every metric space X which is isometric to some separable Banach space or to Urysohn’s universal separable metric space U the following holds: (?)X There exists a nowhere meager subspace of X of cardinality א1 and any two nowhere meager subsets of X of cardinality א1 are almost isometric to each other. As a corollary, it is consistent that...