A computational perspective on network coding
From MaRDI portal
Recommendations
Cites work
- A Random Linear Network Coding Approach to Multicast
- scientific article; zbMATH DE number 3935040 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- Linear network coding
- Network Coding: A Computational Perspective
- Network information flow
- Polynomial Time Algorithms for Multicast Network Code Construction
- Signatures for network coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- The encoding complexity of network coding
Cited in
(12)- Network encoding complexity: exact values, bounds, and inequalities
- Network coding, does the model need tuning?
- 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
- The encoding complexity of network coding
- A separation theorem for single-source network coding
- scientific article; zbMATH DE number 5455109 (Why is no real title available?)
- Network Coding Applications
- Feedback-Based Online Network Coding
- On the Hardness of Approximating the Network Coding Capacity
This page was built for publication: A computational perspective on network coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1958831)