Information theory. Coding theorems for discrete memoryless systems
From MaRDI portal
arbitrarily varying channelchannel capacitydiscrete memoryless channeldiscrete memoryless sourceerror exponentfidelity criterionmulti-terminal systemnon-block source codingrate distortionsource coding theorem
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34) Channel models (including quantum) in information and communication theory (94A40)
Recommendations
Cited in
(only showing first 100 items - show all)- A note on coding theorems of information theory
- Ergodicity of scalar stochastic differential equations with Hölder continuous coefficients
- Krieger's finite generator theorem for actions of countable groups. I.
- Probabilistic methods and distributed information. Rudolf Ahlswede's lectures on information theory 5. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm. With contributions by Vladimir Blinovsky, Holger Boche, Ulrich Krengel and Ahmed Mansour
- A catalog of self-affine hierarchical entropy functions
- The mixing time of the Dikin walk in a polytope -- a simple proof
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
- A gap in the slice rank of \(k\)-tensors
- Partitioning transitive tournaments into isomorphic digraphs
- On abelian and homomorphic secret sharing schemes
- Probabilistic refinement of the asymptotic spectrum of graphs
- On zero-error codes produced by greedy algorithms
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Properties of noncommutative Rényi and Augustin information
- An optimal uniform concentration inequality for discrete entropies on finite alphabets in the high-dimensional setting
- 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
- The sphere packing bound for memoryless channels
- Signaling to relativistic observers: an Einstein-Shannon-Riemann encounter
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average
- Validity indices for clusters of uncertain data objects
- Relative entropy and the Pinsker product formula for sofic groups
- Divergent permutations
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
- Formalization of Shannon's theorems
- List decoding for a multiple access hyperchannel
- Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation
- Almost all regular graphs are normal
- Moderate deviation analysis for classical communication over quantum channels
- Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
- Partial subadditivity of entropies
- Storing and transmitting data. Rudolf Ahlswede's lectures on information theory 1. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm
- Shannon capacity and the categorical product
- Asymptotics for Shamir's problem
- Distillation of secret-key from a class of compound memoryless quantum sources
- Randomized polynomial time protocol for combinatorial Slepian-Wolf problem
- Information-Theoretic Caching: Sequential Coding for Computing
- Almost separating and almost secure frameproof codes over q-ary alphabets
- Entropy and information theory.
- Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources
- Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
- Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
- Dependence of dissipation on the initial distribution over states
- Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
- scientific article; zbMATH DE number 3908323 (Why is no real title available?)
- Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels
- A direct proof of the coding theorem for discrete sources with memory
- Game-theoretic probability combination with applications to resolving conflicts between statistical methods
- Rainbow saturation and graph capacities
- -entropies: convexity, coercivity and hypocoercivity for Fokker-Planck and kinetic Fokker-Planck equations
- Self-predicting Boolean functions
- scientific article; zbMATH DE number 4116450 (Why is no real title available?)
- Transmitting and gaining data. Rudolf Ahlswede's lectures on information theory. Vol. 2. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm
- scientific article; zbMATH DE number 1821199 (Why is no real title available?)
- scientific article; zbMATH DE number 2120700 (Why is no real title available?)
- scientific article; zbMATH DE number 775280 (Why is no real title available?)
- Quantum entropy-typical subspace and universal data compression
- Connector families of graphs
- Strong secrecy for multiple access channels
- On oblivious transfer capacity
- A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
- Safe policy iteration: a monotonically improving approximate policy iteration approach
- Decoding from pooled data: sharp information-theoretic bounds
- Universal coding and prediction on ergodic random points
- scientific article; zbMATH DE number 7625165 (Why is no real title available?)
- The Lehmann type II inverse Weibull distribution in the presence of censored data
- A Medida de Informação de Shannon: Entropia
- Reporting Bayes factors or probabilities to decision makers of unknown loss functions
- Topological Data Analysis in Information Space.
- Symmetric disjunctive list-decoding codes
- Almost cover-free codes and designs
- Nondestructive estimation of the eigenvectors of mixed state
- On capacity regions of discrete asynchronous multiple access channels
- An EM-based iterative method for solving large sparse linear systems
- Combinatorial methods and models. Rudolf Ahlswede's lectures on information theory 4. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm
- Reliability Criteria in Information Theory and in Statistical Hypothesis Testing
- scientific article; zbMATH DE number 3215101 (Why is no real title available?)
- Wave theory of information
- Universal quantum state merging
- Elements of Information Theory
- On Concepts of Performance Parameters for Channels
- Cyclic Division Algebras: A Tool for Space-Time Coding
- Cyclic Division Algebras: A Tool for Space-Time Coding
- Common Information, Noise Stability, and Their Extensions
- Structured Codes of Graphs
- Information Combining
- Information Combining
- 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
- Lower tails via relative entropy
- A family of multipartite entanglement measures
- Universal Features for High-Dimensional Learning and Inference
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
This page was built for publication: Information theory. Coding theorems for discrete memoryless systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894120)
