Information Theory

DOI10.1017/CBO9780511921889zbMath1256.94002OpenAlexW4302366875MaRDI QIDQ5894120

Imre Csiszár, János Körner

Publication date: 16 February 2011

Full work available at URL: https://doi.org/10.1017/cbo9780511921889

zbMATH Keywords

discrete memoryless channelerror exponentsource coding theoremchannel capacityarbitrarily varying channelrate distortionfidelity criteriondiscrete memoryless sourcemulti-terminal systemnon-block source coding

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Measures of information, entropy (94A17) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (86)

Ergodicity of scalar stochastic differential equations with Hölder continuous coefficients ⋮ Structured Codes of Graphs ⋮ List decoding for a multiple access hyperchannel ⋮ Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation ⋮ UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ An optimal uniform concentration inequality for discrete entropies on finite alphabets in the high-dimensional setting ⋮ Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ The Lehmann type II inverse Weibull distribution in the presence of censored data ⋮ Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources ⋮ A Medida de Informação de Shannon: Entropia ⋮ Rainbow Saturation and Graph Capacities ⋮ Reporting Bayes factors or probabilities to decision makers of unknown loss functions ⋮ Almost all regular graphs are normal ⋮ Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes ⋮ Shannon capacity and the categorical product ⋮ Moderate deviation analysis for classical communication over quantum channels ⋮ Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels ⋮ Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem ⋮ Resource theory of heat and work with non-commuting charges ⋮ Identification over quantum broadcast channels ⋮ The geometry of Gaussian double Markovian distributions ⋮ Discrimination of quantum states under locality constraints in the many-copy setting ⋮ Smoothed noise contrastive mutual information neural estimation ⋮ Complete characterization of broadcast and pseudo-signatures from correlations ⋮ Long-Time Limit of Nonlinearly Coupled Measure-Valued Equations that Model Many-Server Queues with Reneging ⋮ Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels ⋮ Strong converse theorems for multimessage networks with tight cut-set bound ⋮ Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity ⋮ The Augustin capacity and center ⋮ Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields ⋮ Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication ⋮ Lower tails via relative entropy ⋮ A family of multipartite entanglement measures ⋮ Unnamed Item ⋮ Universal Features for High-Dimensional Learning and Inference ⋮ Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Probabilistic Amplitude Shaping ⋮ On reconsidering entropies and divergences and their cumulative counterparts: Csiszár's, DPD's and Fisher's type cumulative and survival measures ⋮ Continuity and additivity properties of information decompositions ⋮ A historical perspective on Schützenberger-Pinsker inequalities ⋮ On message authentication with a correlated setup ⋮ Asymptotics for Strassen's optimal transport problem ⋮ Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents ⋮ Partial subadditivity of entropies ⋮ Asymptotics for Shamir's problem ⋮ The sphere packing bound for memoryless channels ⋮ Game-theoretic probability combination with applications to resolving conflicts between statistical methods ⋮ Krieger's finite generator theorem for actions of countable groups. I. ⋮ φ-Entropies: convexity, coercivity and hypocoercivity for Fokker–Planck and kinetic Fokker–Planck equations ⋮ Self-Predicting Boolean Functions ⋮ Signaling to relativistic observers: an Einstein-Shannon-Riemann encounter ⋮ Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages ⋮ Quantum entropy-typical subspace and universal data compression ⋮ Connector families of graphs ⋮ A catalog of self-affine hierarchical entropy functions ⋮ Dependence of dissipation on the initial distribution over states ⋮ Universal quantum state merging ⋮ Computing the partition function of the Sherrington-Kirkpatrick model is hard on average ⋮ Validity indices for clusters of uncertain data objects ⋮ Symmetric disjunctive list-decoding codes ⋮ Almost cover-free codes and designs ⋮ Unnamed Item ⋮ Relative entropy and the Pinsker product formula for sofic groups ⋮ Nondestructive estimation of the eigenvectors of mixed state ⋮ Strong Secrecy for Multiple Access Channels ⋮ On Oblivious Transfer Capacity ⋮ The mixing time of the Dikin walk in a polytope -- a simple proof ⋮ A gap in the slice rank of \(k\)-tensors ⋮ Partitioning transitive tournaments into isomorphic digraphs ⋮ An EM-based iterative method for solving large sparse linear systems ⋮ On abelian and homomorphic secret sharing schemes ⋮ A simple derivation of the refined sphere packing bound under certain symmetry hypotheses ⋮ Divergent permutations ⋮ Distillation of secret-key from a class of compound memoryless quantum sources ⋮ Topological Data Analysis in Information Space. ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior ⋮ Second-order converses via reverse hypercontractivity ⋮ Comparison of contraction coefficients for \(f\)-divergences ⋮ On zero-error codes produced by greedy algorithms ⋮ On Capacity Regions of Discrete Asynchronous Multiple Access Channels ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender ⋮ Formalization of Shannon's theorems ⋮ Decoding from Pooled Data: Sharp Information-Theoretic Bounds ⋮ Properties of noncommutative Rényi and Augustin information

This page was built for publication: Information Theory