ملخص
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 Re from 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 Re capacity edge, in the presence of general network coding functions, is yet to be quantified.
اللغة الأصلية | الإنجليزيّة |
---|---|
عنوان منشور المضيف | 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 |
ناشر | Institute of Electrical and Electronics Engineers Inc. |
الصفحات | 134-141 |
عدد الصفحات | 8 |
رقم المعيار الدولي للكتب (الإلكتروني) | 9781538632666 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - 1 يوليو 2017 |
منشور خارجيًا | نعم |
الحدث | 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 - Monticello, الولايات المتّحدة المدة: ٣ أكتوبر ٢٠١٧ → ٦ أكتوبر ٢٠١٧ |
سلسلة المنشورات
الاسم | 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 |
---|---|
مستوى الصوت | 2018-January |
!!Conference
!!Conference | 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 |
---|---|
الدولة/الإقليم | الولايات المتّحدة |
المدينة | Monticello |
المدة | ٣/١٠/١٧ → ٦/١٠/١٧ |
ملاحظة ببليوغرافية
Publisher Copyright:© 2017 IEEE.