The Shannon capacity of a union
From MaRDI portal
Publication:1297763
DOI10.1007/PL00009824zbMath0921.05039OpenAlexW2030052209MaRDI QIDQ1297763
Publication date: 14 September 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009824
Related Items (33)
When is a random graph projective? ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Shannon capacity and the categorical product ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ On the independence numbers of the cubes of odd cycles ⋮ Constructing Ramsey graphs from Boolean function representations ⋮ Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank ⋮ Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity ⋮ The zero-error capacity of binary channels with 2-memories ⋮ Graph Information Ratio ⋮ Unnamed Item ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ Unnamed Item ⋮ On the Normalized Shannon Capacity of a Union ⋮ New lower bound on the Shannon capacity of \(C_7\) from circular graphs ⋮ Lovász, Vectors, Graphs and Codes ⋮ Independent sets in graphs ⋮ An Introduction to Randomness Extractors ⋮ Privileged users in zero-error transmission over a noisy channel ⋮ Induced Ramsey-type theorems ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Constructive lower bounds for off-diagonal Ramsey numbers ⋮ A limit theorem for the Shannon capacities of odd cycles I ⋮ Unnamed Item ⋮ The minrank of random graphs over arbitrary fields ⋮ Unnamed Item ⋮ Maximum privacy without coherence, zero-error ⋮ Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior ⋮ Explicit two-source extractors and resilient functions ⋮ Topological bounds on the dimension of orthogonal representations of graphs ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ Local chromatic number and Sperner capacity ⋮ On the Shannon capacity of sums and products of graphs
This page was built for publication: The Shannon capacity of a union
