The Edge-Removal Problem’s Connections to the Zero-Error and \delta -Dependence Problems in Network Coding

DOI10.1109/TIT.2019.2949803zbMATH Open1434.94052OpenAlexW2982656703MaRDI QIDQ5211641FDOQ5211641

Authors: Michael Langberg, Michelle Effros 

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2019.2949803

Recommendations

• On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
• scientific article; zbMATH DE number 90560
• Generalizations and applications of the nowhere zero linear mappings in network coding
• Graph Capacities and Zero-Error Transmission Over Compound Channels
• Network encoding complexity: exact values, bounds, and inequalities
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
• Refined Coding Bounds and Code Constructions for Coherent Network Error Correction
• Cut-Set Bounds for Multimessage Multicast Networks With Independent Channels and Zero-Delay Edges

Mathematics Subject Classification ID

Source coding (94A29) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211641)