The following pages link to The Shannon capacity of a union (Q1297763):
Displaying 45 items.
- On the independence numbers of the cubes of odd cycles (Q396806) (← links)
- Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
- Independent sets in graphs (Q501998) (← links)
- When is a random graph projective? (Q852706) (← links)
- Privileged users in zero-error transmission over a noisy channel (Q950333) (← links)
- On the Shannon capacity of a directed graph (Q1074597) (← links)
- On the Shannon capacity of probabilistic graphs (Q1325239) (← links)
- On the capacity of digraphs (Q1378288) (← links)
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős (Q1428861) (← links)
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs (Q1711423) (← links)
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction (Q1928613) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- On the Shannon capacity of sums and products of graphs (Q2111251) (← links)
- Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity (Q2190909) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- The minrank of random graphs over arbitrary fields (Q2303679) (← links)
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior (Q2314153) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- On upper bounding Shannon capacity of graph through generalized conic programming (Q2329653) (← links)
- Asymptotic values of the Hall-ratio for graph powers (Q2433717) (← links)
- Local chromatic number and Sperner capacity (Q2565689) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- Symmetric Shannon capacity is the independence number minus 1 (Q2678437) (← links)
- Origins and genesis (Q2758330) (← links)
- Maximum privacy without coherence, zero-error (Q2825546) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- On the Shannon capacity of a graph (Q4178914) (← links)
- A limit theorem for the Shannon capacities of odd cycles I (Q4417260) (← links)
- Graph Information Ratio (Q4599114) (← links)
- Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs (Q4997309) (← links)
- (Q5009505) (← links)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
- (Q5092448) (← links)
- (Q5121891) (← links)
- On the Normalized Shannon Capacity of a Union (Q5366919) (← links)
- (Q5875499) (← links)
- Induced Ramsey-type theorems (Q5900433) (← links)
- Constructive lower bounds for off-diagonal Ramsey numbers (Q5935811) (← links)
- Relative capacity and dimension of graphs (Q5937942) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- The zero-error capacity of binary channels with 2-memories (Q6089460) (← links)
- Colouring strong products (Q6612523) (← links)
