Rate-distance tradeoff for codes above graph capacity.
Daniel CullinaMarco DalaiYury PolyanskiyPublished in: CoRR (2016)
Keyphrases
- code length
- channel capacity
- random walk
- graph theoretic
- distance measure
- distance function
- distance matrix
- graph model
- graph representation
- directed graph
- graph theory
- structured data
- graph matching
- trade off
- wireless link
- weighted graph
- computational complexity
- euclidean distance
- blocking probability
- traffic intensity
- neighborhood graph
- graph construction
- edge weights
- undirected graph
- graph mining
- error correction
- bipartite graph
- connected components
- distance metric