The encoding complexity of network coding
From MaRDI portal
Recommendations
Cited in
(21)- An effective genetic algorithm for network coding
- A computational perspective on network coding
- Network encoding complexity: exact values, bounds, and inequalities
- Modified characteristics projection finite element method for time-dependent conduction-convection problems
- Network coding, does the model need tuning?
- Exact decoding probability of random linear network coding for combinatorial networks
- scientific article; zbMATH DE number 5831459 (Why is no real title available?)
- scientific article; zbMATH DE number 5129494 (Why is no real title available?)
- Aspects of Random Network Coding
- Network Coding Theory: Single Sources
- A separation theorem for single-source network coding
- scientific article; zbMATH DE number 5455109 (Why is no real title available?)
- Network Coding Capacity With a Constrained Number of Coding Nodes
- scientific article; zbMATH DE number 3543914 (Why is no real title available?)
- scientific article; zbMATH DE number 6866311 (Why is no real title available?)
- Lower Bounds for Multiplication via Network Coding
- On the Hardness of Approximating the Network Coding Capacity
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- On describing the routing capacity regions of networks
- Decoding of random network codes
- The minimum number of hubs in networks
This page was built for publication: The encoding complexity of network coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547208)
