Content deleted Content added
No edit summary |
←Undid revision 116981082 by 137.189.90.241 (talk) |
||
Line 1:
'''Network coding''' is a field of [[information theory]] and [[coding theory]] and is a method of attaining maximum information flow in a [[Network theory|network]].
== General principle ==
== General fThe core notion of network coding is to allow mixing of data at intermediate network nodes. A receiver sees these data packets and deduces from them the messages that were originally intended for that data sink. ▼
A network is a [[directed graph]], where the edges represent pathways for information. Using the [[max-flow min-cut theorem]], one can calculate the maximum amount of information that can be pushed through this network between two nodes. It was shown (2000, Ahlswede et al.) that this max-flow value is achievable, but that [[routing]] is not capable of achieving it.
▲
In the butterfly example below, it is easy to see that no routing scheme can achieve the maximum flow, but that by using a simple coding scheme, the full flow can be attained.
|