By Marco Dalai and Yury Polyanskiy

The capacity of a graph is defined as the rate of exponential grow of independent sets in the strong powers of the graph. In strong power, an edge connects two sequences if at each position letters are equal or adjacent. We consider a variation of the problem where edges in... Show more

August 12, 2015

Loading full text...

Similar articles

Loading recommendations...

x1

Bounds for codes on pentagon and other cycles

Click on play to start listening