• In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It is named...
    12 KB (1,840 words) - 16:54, 9 December 2024
  • Shannon capacity may mean Channel capacity, the capacity of a channel in communications theory Shannon capacity of a graph This disambiguation page lists...
    150 bytes (51 words) - 03:34, 6 December 2024
  • Receiver Shannon–Hartley theorem Spectral efficiency Throughput Shannon capacity of a graph MIMO Cooperative diversity "Transmission rate of a channel"...
    26 KB (4,845 words) - 21:28, 19 June 2025
  • Lovász number (category Graph invariants)
    In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lovász...
    15 KB (2,120 words) - 22:41, 7 June 2025
  • Thumbnail for Perfect graph
    In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...
    59 KB (7,055 words) - 07:30, 25 February 2025
  • Thumbnail for Strong product of graphs
    is not known whether these graphs are biplanar. See page 2 of Lovász, László (1979), "On the Shannon Capacity of a Graph", IEEE Transactions on Information...
    13 KB (1,316 words) - 03:24, 6 January 2024
  • Thumbnail for Erdős–Ko–Rado theorem
    Erdős–Ko–Rado theorem (category Families of sets)
    be strengthened from the independence number to the Shannon capacity of a graph: the Johnson graph corresponding to the t {\displaystyle t} -intersecting...
    44 KB (5,592 words) - 20:57, 17 April 2025
  • Thumbnail for Graph coloring
    In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain...
    70 KB (8,462 words) - 17:45, 4 July 2025
  • {\displaystyle \theta (x)} Lovász theta function, an upper bound on the Shannon capacity of a graph Jacobi theta functions (notational variations), ϑ i j ( z ; τ...
    1 KB (235 words) - 14:02, 4 November 2024
  • ISSN 1557-2862. S2CID 1004947. Lovasz, L. (January 1979). "On the Shannon capacity of a graph". IEEE Transactions on Information Theory. 25 (1): 1–7. doi:10...
    29 KB (4,840 words) - 20:02, 19 June 2025
  • Thumbnail for Claude Shannon
    Sampling Shannon capacity Shannon entropy Shannon index Shannon multigraph Shannon security Shannon switching game Shannon–Fano coding Shannon–Hartley...
    83 KB (8,364 words) - 22:49, 28 June 2025
  • the entropy of a stochastic matrix associated with the graph adjacency matrix ( A i j ) {\displaystyle (A_{ij})} and the random walker Shannon entropy is...
    25 KB (3,470 words) - 19:24, 26 June 2025
  • Nyquist and Ralph Hartley. The Shannon limit or Shannon capacity of a communication channel refers to the maximum rate of error-free data that can theoretically...
    16 KB (2,786 words) - 12:08, 16 April 2025
  • Thumbnail for Entropy (information theory)
    net/WorldInfoCapacity.html Spellerberg, Ian F.; Fedor, Peter J. (2003). "A tribute to Claude Shannon (1916–2001) and a plea for more rigorous use of species...
    72 KB (10,220 words) - 10:44, 30 June 2025
  • Low-density parity-check code (category Capacity-approaching codes)
    1/2). Richard Hamming Claude Shannon David J. C. MacKay Irving S. Reed Michael Luby Graph theory Hamming code Sparse graph code Expander code G.hn/G.9960...
    36 KB (4,626 words) - 16:31, 22 June 2025
  • Galactic algorithm (category Analysis of algorithms)
    Shannon showed a simple but asymptotically optimal code that can reach the theoretical capacity of a communication channel. It requires assigning a random...
    21 KB (2,636 words) - 22:36, 3 July 2025
  • doi:10.1109/18.2639. Marton, K. (1993). "On the Shannon capacity of probabilistic graphs". Journal of Combinatorial Theory. 57 (2): 183–195. doi:10.1006/jctb...
    15 KB (1,367 words) - 12:37, 31 March 2025
  • Edgar Gilbert (category Massachusetts Institute of Technology School of Science alumni)
    Erdős–Rényi–Gilbert model for random graphs, the Gilbert disk model of random geometric graphs, the Gilbert–Shannon–Reeds model of card shuffling, Gilbert tessellations...
    16 KB (1,594 words) - 08:19, 29 December 2024
  • Max-flow min-cut theorem (category Theorems in graph theory)
    cut-set of C are removed, then no positive flow is possible, because there is no path in the resulting graph from the source to the sink. The capacity of an...
    24 KB (3,586 words) - 19:23, 12 February 2025
  • Thumbnail for Pseudoforest
    Pseudoforest (redirect from Unicyclic graph)
    In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and...
    30 KB (4,054 words) - 07:46, 23 June 2025
  • art gallery theorem Five proofs of Turán's theorem Shannon capacity and Lovász number Chromatic number of Kneser graphs Friendship theorem Some proofs...
    5 KB (465 words) - 20:59, 14 May 2025
  • years of research, some advanced FEC systems like polar code come very close to the theoretical maximum given by the Shannon channel capacity under the...
    40 KB (4,704 words) - 10:30, 28 June 2025
  • _{2}{\frac {1}{1-x}}} Shannon's noisy-channel coding theorem gives a result about the rate of information that can be transmitted through a communication channel...
    23 KB (2,613 words) - 21:34, 28 February 2025
  • abstract syntax tree (AST) (a,b)-tree accepting state Ackermann's function active data structure acyclic directed graph adaptive heap sort adaptive Huffman...
    35 KB (3,135 words) - 18:46, 6 May 2025
  • Oil terminals in Ireland (category Pages using the Graph extension)
    total import of oil and oil products into Ireland over the period 1990 to 2019 is shown by the graph. The quantity is in thousand tonnes of oil equivalent...
    9 KB (500 words) - 10:29, 29 June 2025
  • Thumbnail for Dublin Airport
    Dublin Airport (category Pages using the Graph extension)
    operates a base at the airport. United States border preclearance services are available at the airport for U.S.-bound passengers. Shannon Airport, also...
    145 KB (9,725 words) - 16:24, 25 June 2025
  • Thumbnail for Telecommunications network
    the speed and capacity of digital computers, provided by advances in semiconductor technology and expressed in the bi-yearly doubling of transistor density...
    7 KB (804 words) - 22:10, 24 May 2025
  • Thumbnail for Communication channel
    Propagation graph, models signal dispersion by representing the radio propagation environment by a graph. Mobility models, which also causes a time-variant...
    14 KB (1,804 words) - 23:41, 30 June 2025
  • Thumbnail for Google
    Google (redirect from Google Inc Class A)
    to expand its New York City office to a capacity of 12,000 employees. The same December, it was announced that a $1 billion, 1,700,000-square-foot (160...
    264 KB (22,067 words) - 10:01, 29 June 2025
  • Matthew Hastings (category Year of birth missing (living people))
    classical capacity of quantum channels, a long standing open problem in quantum Shannon theory. He and Michael Freedman formulated the NLTS conjecture, a precursor...
    3 KB (291 words) - 00:48, 18 March 2025