# Shannon capacity of a graph

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Electr. J. Comb.
- 2013

The Shannon capacity of a graph G is c(G) = supd>1(α(G d)) 1 d , where α(G) is the independence number of G. The Shannon capacity… (More)

Is this relevant?

2011

2011

- 2011

This thesis focuses on the Shannon capacity of a graph. Suppose we want to send a message across a channel to a receiver. The… (More)

Is this relevant?

2006

2006

- IEEE Transactions on Information Theory
- 2006

The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

We consider a class of finite-state Markov channels with feedback. We first introduce a simplified equivalent channel model, and… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 2005

We show that the weighted versions of the stable set problem, the clique problem, the coloring problem and the clique covering… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. Communications
- 2003

Recent advancements in iterative processing of channel codes and the development of turbo codes have allowed the communications… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Combinatorica
- 1998

For an undirected graph G = (V,E), let G denote the graph whose vertex set is V n in which two distinct vertices (u1, u2… (More)

Is this relevant?

1985

1985

- Eur. J. Comb.
- 1985

For definitions and notations see [1]. Suppose G is a graph-directed or undirectedand let Aa be the matrix of G with Is on the… (More)

Is this relevant?

1979

1979

- IEEE Trans. Information Theory
- 1979

A/Mmcr-It is proved that the Shannon zero-error capacity of the pentagon is e. The method is then generalized to obtain upper… (More)

Is this relevant?

Highly Cited

1979