Skip to search formSkip to main contentSkip to account menu

Shannon capacity of a graph

Known as: Confusability graph, Confusion graph 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Code wordComputational complexity theoryEllipsoid methodGraph theory

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A tradeoff between data rate and regulation performance in networked data flow control
The report investigates fundamental trade-offs related to the static regulation performance in networked control systems with… 
2008
2008
State estimation via limited capacity noisy communication channels
  • A. Matveev
  • Math. Control. Signals Syst.
  • 2008
  • Corpus ID: 42275852
The paper addresses a state estimation problem involving communication errors and capacity constraints. Discrete-time partially… 
2008
2008
DVB-S2 LDPC Decoding Using Robust Check Node Update Approximations
Broadband satellite services to fixed terminals are currently offered in the forward link by the 2nd generation (2G) digital… 
2006
2006
A novel random wireless packet multiple access method using CDMA
Random packet CDMA, a novel packet-based multiple access scheme for connectionless, uncoordinated random channel access is… 
2006
2006
Anytime coding on the infinite bandwidth AWGN channel: A sequential semi-orthogonal optimal code
It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel… 
2006
2006
Novel Shannon Graph Entropy, Capacity: Spectral Graph Theory
In this research paper, an interesting probability mass function is associated with the vertices of graph. One among the various… 
2004
2004
New space-time coding techniques with bit interleaved coded modulations
pour toute la sympathie qu'ils ont offert pendant mes séjours en Bretagne. Je remercie tous lescolì egues et amis du département… 
2001
2001
On the loading of peak-energy-limited multicarrier systems transmitting over spectrally-shaped crosstalk-impaired DSLs
We develop the solution for optimal loading of digital subscriber loop (DSL) multicarrier (MC) systems that present constraints… 
Highly Cited
1997
Highly Cited
1997
Approaching Shannon's capacity limit by 0.2 dB using simple Hamming codes
The authors show that the Shannon capacity limit for the additive white Gaussian noise (AWGN) channel can be approached within 0… 
1987
1987
Some families of zero- error block codes for the two-user binary adder channel with feedback
Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced. Two… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)