Pages that link to "Item:Q4915227"
From MaRDI portal
The following pages link to Information Theory, Combinatorics, and Search Theory (Q4915227):
Displaying 36 items.
- On the Value of Multiple Read/Write Streams for Data Compression (Q3637105) (← links)
- Two New Results for Identification for Sources (Q4915228) (← links)
- L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order (Q4915229) (← links)
- Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme (Q4915231) (← links)
- Strong Secrecy for Multiple Access Channels (Q4915232) (← links)
- Capacity Results for Arbitrarily Varying Wiretap Channels (Q4915233) (← links)
- On Oblivious Transfer Capacity (Q4915234) (← links)
- Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay (Q4915235) (← links)
- Uniformly Generating Origin Destination Tables (Q4915236) (← links)
- Identification via Quantum Channels (Q4915237) (← links)
- Classical-Quantum Arbitrarily Varying Wiretap Channel (Q4915238) (← links)
- Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities (Q4915239) (← links)
- How to Read a Randomly Mixed Up Message (Q4915241) (← links)
- Multiple Objects: Error Exponents in Hypotheses Testing and Identification (Q4915243) (← links)
- Family Complexity and VC-Dimension (Q4915244) (← links)
- The Restricted Word Shadow Problem (Q4915245) (← links)
- Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals (Q4915246) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- On Data Recovery in Distributed Databases (Q4915248) (← links)
- An Unstable Hypergraph Problem with a Unique Optimal Solution (Q4915249) (← links)
- Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions (Q4915250) (← links)
- Threshold Functions for Distinct Parts: Revisiting Erdős–Lehner (Q4915251) (← links)
- On Some Structural Properties of Star and Pancake Graphs (Q4915252) (← links)
- Threshold and Majority Group Testing (Q4915253) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)
- Density-Based Group Testing (Q4915256) (← links)
- Group Testing with Multiple Mutually-Obscuring Positives (Q4915257) (← links)
- An Efficient Algorithm for Combinatorial Group Testing (Q4915259) (← links)
- Randomized Post-optimization for t-Restrictions (Q4915260) (← links)
- Search for Sparse Active Inputs: A Review (Q4915261) (← links)
- Search When the Lie Depends on the Target (Q4915262) (← links)
- A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264) (← links)
- Remarks on History and Presence of Game Tree Search and Research (Q4915265) (← links)
- Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture (Q4915267) (← links)
- Creating Order and Ballot Sequences (Q4915268) (← links)
