A Local Perspective on the Edge Removal Problem

Fei Wei, Michael Langberg, Michelle Effros

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The edge removal problem studies the loss in network coding rates that results when a network communication edge is removed from a given network. It is known, for example, that in networks restricted to linear coding schemes and networks restricted to Abelian group codes, removing an edge e with capacity Re reduces the achievable rate on each source by no more than Re. In this work, we seek to uncover larger families of encoding functions for which the edge removal statement holds. We take a local perspective: instead of requiring that all network encoding functions satisfy certain restrictions (e.g., linearity), we limit only the function carried on the removed edge e. Our central results give sufficient conditions on the function carried by edge e in the code used to achieve a particular rate vector under which we can demonstrate the achievability of a related rate vector once e is removed.

Original languageEnglish
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781538692912
StatePublished - Jul 2019
Externally publishedYes
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: 7 Jul 201912 Jul 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Conference2019 IEEE International Symposium on Information Theory, ISIT 2019

Bibliographical note

Publisher Copyright:
© 2019 IEEE.


Dive into the research topics of 'A Local Perspective on the Edge Removal Problem'. Together they form a unique fingerprint.

Cite this