The following pages link to Information Theory (Q5894120):
Displayed 50 items.
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
- Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes (Q358133) (← links)
- Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels (Q406127) (← links)
- Game-theoretic probability combination with applications to resolving conflicts between statistical methods (Q448957) (← links)
- Quantum entropy-typical subspace and universal data compression (Q488153) (← links)
- Connector families of graphs (Q489306) (← links)
- Symmetric disjunctive list-decoding codes (Q510468) (← links)
- Almost cover-free codes and designs (Q510471) (← links)
- Nondestructive estimation of the eigenvectors of mixed state (Q517596) (← links)
- Second-order converses via reverse hypercontractivity (Q778887) (← links)
- Comparison of contraction coefficients for \(f\)-divergences (Q784380) (← links)
- On message authentication with a correlated setup (Q903369) (← links)
- Ergodicity of scalar stochastic differential equations with Hölder continuous coefficients (Q1615890) (← links)
- Krieger's finite generator theorem for actions of countable groups. I. (Q1717655) (← links)
- A catalog of self-affine hierarchical entropy functions (Q1736493) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication (Q1937286) (← links)
- A gap in the slice rank of \(k\)-tensors (Q2005208) (← links)
- Partitioning transitive tournaments into isomorphic digraphs (Q2035088) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender (Q2106027) (← links)
- Properties of noncommutative Rényi and Augustin information (Q2113490) (← links)
- An optimal uniform concentration inequality for discrete entropies on finite alphabets in the high-dimensional setting (Q2137047) (← links)
- Strong converse theorems for multimessage networks with tight cut-set bound (Q2190898) (← links)
- Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity (Q2190909) (← links)
- The Augustin capacity and center (Q2190923) (← links)
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields (Q2190980) (← links)
- The sphere packing bound for memoryless channels (Q2211175) (← links)
- Signaling to relativistic observers: an Einstein-Shannon-Riemann encounter (Q2229573) (← links)
- Computing the partition function of the Sherrington-Kirkpatrick model is hard on average (Q2240857) (← links)
- Validity indices for clusters of uncertain data objects (Q2241184) (← links)
- Relative entropy and the Pinsker product formula for sofic groups (Q2245013) (← links)
- Divergent permutations (Q2306003) (← links)
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior (Q2314153) (← links)
- Formalization of Shannon's theorems (Q2352494) (← links)
- List decoding for a multiple access hyperchannel (Q2364452) (← links)
- Degradable channels, less noisy channels, and quantum statistical morphisms: an equivalence relation (Q2364469) (← links)
- Almost all regular graphs are normal (Q2399290) (← links)
- Moderate deviation analysis for classical communication over quantum channels (Q2406109) (← links)
- Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels (Q2412624) (← links)
- Partial subadditivity of entropies (Q2435535) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- Asymptotics for Shamir's problem (Q2700633) (← links)
- Distillation of secret-key from a class of compound memoryless quantum sources (Q2820903) (← links)
- Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem (Q2946394) (← links)
- Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources (Q3189936) (← links)
- Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages (Q3298908) (← links)
- Dependence of dissipation on the initial distribution over states (Q3303161) (← links)