Sufficient conditions on the encoding function of a removed edge e* guarantee that a related rate vector remains achievable after removal in network coding.
Network coding capacity regions via entropy functions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
Characterizes the secure unicast rate when a single non-source node generates random keys against an eavesdropper accessing z links.
citing papers explorer
-
A Local Perspective on the Edge Removal Problem
Sufficient conditions on the encoding function of a removed edge e* guarantee that a related rate vector remains achievable after removal in network coding.
-
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys
Characterizes the secure unicast rate when a single non-source node generates random keys against an eavesdropper accessing z links.