scientific article
From MaRDI portal
Publication:3499280
zbMath1154.94001MaRDI QIDQ3499280
Publication date: 29 May 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Circuits, networks (94C99) Information theory (general) (94A15) Communication theory (94A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (51)
Information anatomy of stochastic equilibria ⋮ On Slepian-Wolf theorem with interaction ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Network encoding complexity: exact values, bounds, and inequalities ⋮ Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ⋮ Two properties of prefix codes and uniquely decodable codes ⋮ Tsallis mutual information for document classification ⋮ Smoothed noise contrastive mutual information neural estimation ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ Estimations of \(f\)- and Rényi divergences by using a cyclic refinement of the Jensen's inequality ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ Computation of channel capacity based on self-concordant functions ⋮ Geometry of EM and related iterative algorithms ⋮ Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs ⋮ Information-theoretic interpretation of quantum formalism ⋮ The entropic approach to causal correlations ⋮ Optimal Control and Signaling Strategies of Control-Coding Capacity of General Decision Models: Applications to Gaussian Models and Decentralized Strategies ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ On the Inequalities of Projected Volumes and the Constructible Region ⋮ Neural network coding of natural images with applications to pure mathematics ⋮ An efficient homomorphic aggregate signature scheme based on lattice ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ Unnamed Item ⋮ Partial monotonicity of entropy revisited ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ Exact decoding probability of random linear network coding for combinatorial networks ⋮ Secure multi-source network coding scheme with lattice signature ⋮ Causal structures from entropic information: geometry and novel scenarios ⋮ Security risk during the transient in a key exchange protocol using random signals and feedback ⋮ Infinite Shannon entropy ⋮ Secret-Sharing Schemes: A Survey ⋮ Extending Swerdlow's hypothesis: statistical models of mitochondrial deterioration and aging ⋮ Nondestructive estimation of the eigenvectors of mixed state ⋮ Environmental induction of neurodevelopmental disorders ⋮ On Slepian–Wolf Theorem with Interaction ⋮ Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Unique information via dependency constraints ⋮ Network coding in undirected graphs is either very helpful or not helpful at all ⋮ Information of interactions in complex systems ⋮ Interaction information: linear and nonlinear interpretations ⋮ Dimensionally sharp inequalities for the linear entropy ⋮ Identifying functional thermodynamics in autonomous Maxwellian ratchets ⋮ Robust entanglement distribution via quantum network coding ⋮ Contribution of Frantisek Matus to the research on conditional independence ⋮ Violations of the Ingleton inequality and revising the four-atom conjecture ⋮ Characterisation of conditional independence structures for polymatroids using vanishing sets ⋮ On typical encodings of multivariate ergodic sources ⋮ Tropical probability theory and an application to the entropic cone ⋮ Network information flow ⋮ Probabilistic Reasoning in the Description Logic $$\mathcal {ALCP}$$ with the Principle of Maximum Entropy
This page was built for publication:
