On the Hardness of Approximating the Network Coding Capacity
From MaRDI portal
Publication:5281090
Recommendations
- The encoding complexity of network coding
- Network Coding Capacity With a Constrained Number of Coding Nodes
- On the Capacity of Noncoherent Network Coding
- Network encoding complexity: exact values, bounds, and inequalities
- A computational perspective on network coding
- Deterministic-Coding Capacity of Networks in the Low-Power Regime
- Network Coding: A Computational Perspective
- Network Coding Capacity Regions via Entropy Functions
- An approximation approach to network information theory
- Network Coding for Computing: Cut-Set Bounds
Cited in
(7)- Linear index coding via semidefinite programming
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- Local orthogonality dimension
- Network coding, does the model need tuning?
- On minrank and the Lovász theta-function
- Topological bounds on the dimension of orthogonal representations of graphs
- Linear index coding via semidefinite programming
This page was built for publication: On the Hardness of Approximating the Network Coding Capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281090)