Rate-distance tradeoff for codes above graph capacity
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 where edges in the power grap...
| Principais autores: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Artigo |
| Idioma: | en_US |
| Publicado em: |
Institute of Electrical and Electronics Engineers (IEEE)
2017
|
| Acesso em linha: | http://hdl.handle.net/1721.1/111670 https://orcid.org/0000-0002-2109-0979 |