Recommendations
Cited in
(50)- The minrank of random graphs over arbitrary fields
- On the normalized Shannon capacity of a union
- On the independence numbers of the cubes of odd cycles
- Colouring strong products
- A limit theorem for the Shannon capacities of odd cycles I
- On the Shannon capacity of a directed graph
- Maximum privacy without coherence, zero-error
- Asymptotic values of the Hall-ratio for graph powers
- Independent sets in graphs
- Privileged users in zero-error transmission over a noisy channel
- On graphs in which the Shannon capacity is unachievable by finite product
- An introduction to randomness extractors
- Origins and genesis
- Constructive lower bounds for off-diagonal Ramsey numbers
- On the conjunctive capacity of graphs
- Constructing Ramsey graphs from Boolean function representations
- Violating the Shannon capacity of metric graphs with entanglement
- The zero-error capacity of binary channels with 2-memories
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- On the Shannon capacity of triangular graphs
- Local chromatic number and Sperner capacity
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- When is a random graph projective?
- Topological bounds on the dimension of orthogonal representations of graphs
- Shannon capacity and the categorical product
- Explicit two-source extractors and resilient functions
- scientific article; zbMATH DE number 826055 (Why is no real title available?)
- On the Shannon capacity of a graph
- scientific article; zbMATH DE number 7250143 (Why is no real title available?)
- Symmetric Shannon capacity is the independence number minus 1
- scientific article; zbMATH DE number 2197920 (Why is no real title available?)
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
- Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs
- On upper bounding Shannon capacity of graph through generalized conic programming
- Relative capacity and dimension of graphs
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- On the Shannon capacity of sums and products of graphs
- Induced Ramsey-type theorems
- Lovász, vectors, graphs and codes
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- On minrank and the Lovász theta-function
- Probabilistic refinement of the asymptotic spectrum of graphs
- The Shannon capacity of a graph and the independence numbers of its powers
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
- On the capacity of uniform hypergraphs
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- A combinatorial approach to nonlocality and contextuality
- Graph information ratio
This page was built for publication: The Shannon capacity of a union
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297763)
