We study frames from the viewpoint of coding theory. We introduce a numerical measure of how well a frame reconstructs vectors when some of the frame coefficients of a vector are lost and then attempt to find and classify the frames that are optimal in this setting.
These notes give an introduction to the theory of reproducing kernel Hilbert spaces and their multipliers. We begin with the material that is contained in Aronszajn's classic paper on the subject. We take a somewhat algebraic view of some of his results and discuss them in the context of pull-back and push-out constructions. We then prove Schoenberg's results on negative definite functions and his characterization of metric spaces that can be embedded isometrically in Hilbert spaces. Following this we study multipliers of reproducing kernel Hilbert spaces and use them to give classic proofs of Pick's and Nevanlinna's theorems. In later chapters we consider generalizations of this theory to the vector-valued setting.
The purpose of the present paper is to lay the foundations for a systematic study of tensor products of operator systems. After giving an axiomatic definition of tensor products in this category, we examine in detail several particular examples of tensor products, including a minimal, maximal, maximal commuting, maximal injective and some asymmetric tensor products. We characterize these tensor products in terms of their universal properties and give descriptions of their positive cones. We also characterize the corresponding tensor products of operator spaces induced by a certain canonical inclusion of an operator space into an operator system. We examine notions of nuclearity for our tensor products which, on the category of C*-algebras, reduce to the classical notion. We exhibit an operator system S which is not completely order isomorphic to a C*-algebra yet has the property that for every C*-algebra A, the minimal and maximal tensor product of S and A are equal.
We continue our study of tensor products in the operator system category. We define operator system quotients and exactness in this setting and refine the notion of nuclearity by studying operator systems that preserve various pairs of tensor products. One of our main goals is to relate these refinements of nuclearity to the Kirchberg conjecture. In particular, we prove that the Kirchberg conjecture is equivalent to the statement that every operator system that is (min,er)-nuclear is also (el,c)-nuclear. We show that operator system quotients are not always equal to the corresponding operator space quotients and then study exactness of various operator system tensor products for the operator system quotient. We prove that an operator system is exact for the min tensor product if and only if it is (min,el)nuclear. We give many characterizations of operator systems that are (min,er)-nulcear, (el,c)nuclear, (min,el)-nulcear and (el,max)-nuclear. These characterizations involve operator system analogues of various properties from the theory of C*-algebras and operator spaces, including the WEP and LLP.
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two frame coefficients are set to zero. Here, we consider various numerical measures for the reconstruction error associated with a frame when an arbitrary number of the frame coefficients of a vector are lost. We derive general error bounds for two-uniform frames when more than two erasures occur and apply these to concrete examples. We show that among the 227 known equivalence classes of twouniform (36, 15)-frames arising from Hadamard matrices, there are 5 that give smallest error bounds for up to 8 erasures.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.