Network encoding complexity: exact values, bounds, and inequalities
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5129494 (Why is no real title available?)
- scientific article; zbMATH DE number 3499845 (Why is no real title available?)
- Elements of Information Theory
- Information theory and network coding
- Linear network coding
- Polynomial Time Algorithms for Multicast Network Code Construction
- The Complexity of Network Coding With Two Unit-Rate Multicast Sessions
- The encoding complexity of network coding
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(7)- Exact decoding probability of random linear network coding for combinatorial networks
- scientific article; zbMATH DE number 4145830 (Why is no real title available?)
- On the Hardness of Approximating the Network Coding Capacity
- A computational perspective on network coding
- On mergings in acyclic directed graphs
- The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding
- Lower Bounds for Multiplication via Network Coding
This page was built for publication: Network encoding complexity: exact values, bounds, and inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408285)