TOPICS
Search

Network Coding


Network coding is a method of transmitting messages through a network in which intermediate vertices may send functions of received messages instead of merely forwarding them. A linear network code uses linear combinations over a finite field. Coding must respect the capacities of the edges and allow each destination to recover its requested message.

The Li-Li conjecture proposed that such coding cannot improve the common rate for independent multiple-unicast demands in an undirected network. Braverman and He (2026) and Zhang et al. (2026) reported counterexamples.


See also

Finite Field, Li-Li Conjecture, Network Flow

Explore with Wolfram|Alpha

References

Braverman, M. and He, Z. "The Multiple Unicast Conjecture Is False." 7 Oct 2026. https://arxiv.org/abs/2610.10108.Zhang, X.; Li, B.; and Li, Z. "Network Coding Can Beat Routing in Undirected Multiple-Unicast Networks." 7 Oct 2026. https://arxiv.org/abs/2610.09367.

Cite this as:

Weisstein, Eric W. "Network Coding." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/NetworkCoding.html

Subject classifications