= Shannon capacity of a graph
{wiki=Shannon_capacity_of_a_graph}
The Shannon capacity of a graph is a concept in information theory that relates to the maximum rate at which information can be transmitted over a noisy channel represented by the graph, while ensuring that the probability of error in the transmission approaches zero as the number of transmitted messages increases. Specifically, the Shannon capacity \\( C(G) \\) of a graph \\( G \\) is defined as the supremum of the rates at which information can be reliably transmitted over the channel represented by the graph.
Back to article page