Information Distance - Information Theory, IEEE Transactions on
نویسندگان
چکیده
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distance between two individual objects, for example, two pictures. We give several natural definitions of a universal information metric, based on length of shortest programs for either ordinary computations or reversible (dissipationless) computations. It turns out that these definitions are equivalent up to an additive logarithmic term. We show that the information distance is a universal cognitive similarity distance. We investigate the maximal correlation of the shortest programs involved, the maximal uncorrelation of programs (a generalization of the Slepian–Wolf theorem of classical information theory), and the density properties of the discrete metric spaces induced by the information distances. A related distance measures the amount of nonreversibility of a computation. Using the physical theory of reversible computation, we give an appropriate (universal, antisymmetric, and transitive) measure of the thermodynamic work required to transform one object in another object by the most efficient process. Information distance between individual objects is needed in pattern recognition where one wants to express effective notions of “pattern similarity” or “cognitive similarity” between individual objects and in thermodynamics of computation where one wants to analyze the energy dissipation of a computation from a particular input to a particular output.
منابع مشابه
Modelling and Experimental Testing of Asymmetric Information Problems in Lease and Hire Contracts (Based on Contract Theory)
This article aims to study lease and hiring contract in the Iranian-Islamic setting and analyze the asymmetric information problem in these contracts. For doing this, we study the characteristics of lease and hiring contracts in Iran (real world experimental characteristics that recognized in other studies), using library method, then we mathematically model different aspects of asymmetric info...
متن کاملComments on 'Generating and counting binary Bent sequences'
We prove that the conjecture on bent sequences stated in Generating and counting bent sequences IEEE Transactions on Information Theory IT No by C M Adams and S E Tavares is false Let Vn be the vector space of n tuples of elements from GF Any map from Vn to GF f can be uniquely written as a polynomial in coordinates x xn f x xn M
متن کاملSEQUANS Communications White Paper: MIMO Techniques for Mobile WiMAX Systems
He has published several journal and conference papers and holds several international patents. a renowned expert in the field of wireless communications. Prior to Stanford, she was with California Institute of Technology and held industry positions at AT&T Bell laboratories and MAXIM Technologies. She is an IEEE Fellow (2005), a Distinguished Lecturer and a member of the Board of Governors of ...
متن کاملAttacks on the Authenticated Encryption Mode of Operation PAE
We show several concrete attacks on an authenticated encryption scheme PAE which appeared in IEEE Transactions on Information Theory, Vol. 56, no. 8, pp. 4025–4037. Additionally we show some flaws and oversights in the analysis (presented in the same paper) used to prove PAE to be a secure authenticated encryption scheme.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998