Derives the Slepian-Wolf rate region for distributed source coding of connected soft random geometric graphs by proving new entropy limit theorems and asymptotic equipartition properties.
On Lossy Compression of Directed Graphs , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
Derives the Slepian-Wolf rate region for distributed source coding of connected soft random geometric graphs by proving new entropy limit theorems and asymptotic equipartition properties.