scientific article
From MaRDI portal
Publication:3895387
zbMath0448.94002MaRDI QIDQ3895387
No author found.
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
robustificationcoloring hypergraphsgraph decompositionmulti-user source codingrate distortioncovering hypergraphsarbitrarily varying correlated sources
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)
Related Items (22)
Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources ⋮ Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources ⋮ A general 4-words inequality with consequences for 2-way communication complexity ⋮ Transforming monitoring structures with resilient encoders -- application to repeated games ⋮ Coding for write-efficient memory ⋮ Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels ⋮ Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity ⋮ Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels ⋮ Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels ⋮ Message transmission over classical quantum channels with a jammer with side information: Correlation as resource, common randomness generation ⋮ Ratewise-optimal non-sequential search strategies under constraints on the tests ⋮ Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation ⋮ Strong Secrecy for Multiple Access Channels ⋮ Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities ⋮ Orderings of uniquely colorable hypergraphs ⋮ Creating order in sequence spaces with simple machines ⋮ On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information ⋮ General theory of information transfer ⋮ Large families of pseudorandom sequences of k symbols and their complexity, Part II ⋮ Large families of pseudorandom sequences of k symbols and their complexity, Part I ⋮ On partitions of a rectangle into rectangles with restricted number of cross sections ⋮ Properties of noncommutative Rényi and Augustin information
This page was built for publication:
