The effect of removing a network communication edge: Group network codes
Fei Wei, Michael L. Langberg · 2017
The edge removal problem quantifies the loss in rate when removing an edge from a given network. In this work, we study the edge removal problem on network coding instances that are solvable using group network codes. We show that removing any edge of capacity Refrom a given network reduces the rate vector achievable by abelian group network codes by at most an additive Re. Our work extends previous results of similar nature on linear network codes which are a special case of group network codes. The extent to which the achievable rate is affected by removing an Recapacity edge, in the presence of general network coding functions, is yet to be quantified.