scientific article; zbMATH DE number 3497786

zbMath0317.94025MaRDI QIDQ4079503

Peter Gács, János Körner

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Information theory (general) (94A15) Transition functions, generators and resolvents (60J35)

Related Items (31)

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources ⋮ Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Common randomness and distributed control: A counterexample ⋮ Clustering with respect to the information distance ⋮ Abelian sharing, common informations, and linear rank inequalities ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Stability of properties of Kolmogorov complexity under relativization ⋮ Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources ⋮ On ideal and weakly-ideal access structures ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Universal Features for High-Dimensional Learning and Inference ⋮ Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács ⋮ Multiple-user communication ⋮ On the \(\Phi \)-stability and related conjectures ⋮ Secure non-interactive reducibility is decidable ⋮ Continuity and additivity properties of information decompositions ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ On a connection between information and group lattices ⋮ The classical-quantum multiple access channel with conferencing encoders and with common messages ⋮ An operational characterization of mutual information in algorithmic information theory ⋮ Kolmogorov Complexity as a Language ⋮ Arbitrarily small amounts of correlation for arbitrarily varying quantum channels ⋮ Dimension Reduction for Polynomials over Gaussian Space and Applications ⋮ Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\) ⋮ On common information ⋮ Inequalities for Shannon entropy and Kolmogorov complexity ⋮ Common Information, Noise Stability, and Their Extensions

This page was built for publication: