Rate-distance tradeoff for codes above graph capacity

Preprint, Article English OPEN
Cullina, Daniel; Dalai, Marco; Polyanskiy, Yury;
(2016)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
  • Related identifiers: doi: 10.1109/ISIT.2016.7541515
  • Subject: Computer Science - Information Theory

The capacity of a graph is defined as the rate of exponential growth of independent sets in the strong powers of the graph. In the strong power an edge connects two sequences if at each position their letters are equal or adjacent. We consider a variation of the problem... View more
Share - Bookmark