Insufficiency of Linear Coding in Network Information Flow
From MaRDI portal
Recommendations
Cited in
(20)- Unachievability of network coding capacity
- Representations of the multicast network problem
- On the capacity of multiple unicast sessions in undirected graphs
- Structural routability of n-pairs information networks
- Network routing capacity
- Polynomial-Time Construction of Linear Network Coding
- The serializability of network codes
- Dualities Between Entropy Functions and Network Codes
- Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks
- Revisiting the linear information flow algorithm
- External codes for multiple unicast networks via interference alignment
- Complexity classification of network information flow problems
- Robust entanglement distribution via quantum network coding
- Improved Jaggi-Sanders algorithms for constructing linear broadcast and linear dispersion network coding
- A characterization of solvability for a class of networks
- Linearity and Solvability in Multicast Networks
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks
- Violations of the Ingleton inequality and revising the four-atom conjecture.
- Matroidal error correction networks and linear network error correction MDS codes
- Linear network coding
This page was built for publication: Insufficiency of Linear Coding in Network Information Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546816)