Talk:Linear network coding
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
[Untitled]
editThe Butterfly network is directly analogous to the connection of two telephones. The telephones have 4 wire networks (transmit and receive pairs). These are linked by a 2 wire network (a single pair) which carries the signals from both ends. Each telephone has a hybrid circuit or using another name a 2 to 4 wire converter to make the required conversions.
The use of 2 wire transmission to save on switching and transmission pairs seems to be the same reason that coding is attractive in conserving router bandwidth.
Is network coding a digital version of 2 wire (2W) transmission in telephony? It would seem to be clear that it is at a surface level. 2W wire transmission is well over a century old in telpehony.
Note that the 2 to 4W conversion analogy in the case of network coding and wireless networks.
While the statement that the Min Cut Max Flow Theorem produces the maximum theoretical capacity of a network [from the point of view of a single designated user node pair]is strictly speaking correct, it is a poor bound. This is so since its use assumes that no other nodes are inputing/outputing any data other than a specific designated pair. That is the same pair that defines the appropraite cut referred to by the Min Cut Max flow method. Consequently the use of the resultant to establish an upper bound for the capacity/utility in any useful sense is way too optimistic. Any meaningful estimate would have to assume some spatial/temporal distribution of concurrent users. Since the selection of a parametric distribution brings into play many additional degrees of modeling freedom, a prefered standard seems a long shot to say the least. Of course many more practical limitatins on the connectivity of the network [eg the reachability of a specific node from another without some necesary indirectivity] bring into play many more such model dependent conditions and parameters. Therefore it would seem that a meaningful capacity calculation based on "network topology" alone is not possible for any but the simplist "toy problems" Charmonimu5 21:58, 29 August 2007 (UTC) Richard Schmidt
Copyright problem removed
editPrior content in this article duplicated one or more previously published sources. The material was copied from: http://arena.cse.sc.edu/lib/exe/fetch.php/wiki/arena/public/publications/rocx.secon06.pdf. Infringing material has been rewritten or removed and must not be restored, unless it is duly released under a compatible license. (For more information, please see "using copyrighted works from others" if you are not the copyright holder of this material, or "donating copyrighted materials" if you are.) For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of information, but not as a source of sentences or phrases. Accordingly, the material may be rewritten, but only if it does not infringe on the copyright of the original or plagiarize from that source. Please see our guideline on non-free text for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators will be blocked from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you. Dpmuk (talk) 22:12, 2 March 2012 (UTC)
How about a random network coding example?
editThis article scores well explaining networking coding, but then falls apart on random coding. Pity. — Preceding unsigned comment added by 75.70.92.195 (talk) 19:07, 5 June 2014 (UTC)
External links modified
editHello fellow Wikipedians,
I have just modified 4 external links on Linear network coding. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
- Added archive https://web.archive.org/web/20071108173654/http://www.ericsson.com/technology/research_papers/wireless_access/doc/Multi-User%20ARQ.pdf to http://www.ericsson.com/technology/research_papers/wireless_access/doc/Multi-User%20ARQ.pdf
- Added archive https://web.archive.org/web/20110719100201/https://wiki.lnt.ei.tum.de/doku.php?id=network_coding%3Abibliography_for_network_coding to https://wiki.lnt.ei.tum.de/doku.php?id=network_coding%3Abibliography_for_network_coding
- Added archive https://web.archive.org/web/20060618083034/http://www.mit.edu/~medard/coding1.htm to http://www.mit.edu/~medard/coding1.htm
- Added archive https://web.archive.org/web/20090331225831/http://www.networkworld.com/news/2007/121007-network-coding.html to http://www.networkworld.com/news/2007/121007-network-coding.html
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).
- If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
- If you found an error with any archives or the URLs themselves, you can fix them with this tool.
Cheers.—InternetArchiveBot (Report bug) 10:08, 16 May 2017 (UTC)
External links modified
editHello fellow Wikipedians,
I have just modified 2 external links on Linear network coding. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
- Added
{{dead link}}tag to http://home.eng.iastate.edu/~yuzhen/publications/ZhenYu_INFOCOM_2008.pdf - Added archive https://web.archive.org/web/20081011124616/http://arena.cse.sc.edu/papers/rocx.secon06.pdf to http://arena.cse.sc.edu/papers/rocx.secon06.pdf
- Added archive https://web.archive.org/web/20081011124616/http://arena.cse.sc.edu/papers/rocx.secon06.pdf to http://arena.cse.sc.edu/papers/rocx.secon06.pdf
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).
- If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
- If you found an error with any archives or the URLs themselves, you can fix them with this tool.
Cheers.—InternetArchiveBot (Report bug) 18:48, 23 December 2017 (UTC)