by RLE at MIT | Jan 9, 2013 | News Links
A new algorithm for message dissemination in decentralized networks is faster than its predecessors but, unlike them, guarantees delivery. « more » Related Links: Guaranteed delivery — in ad hoc networks EECS grad student Bernhard Haeupler wins best...
by RLE at MIT | Oct 23, 2012 | News Links
A dash of algebra on wireless networks promises to boost bandwidth tenfold, without new infrastructure. «more» Related Links: A Bandwidth Breakthrough Professor Muriel Medard RLE Network Coding and Reliable Communications...
by RLE at MIT | May 15, 2012 | News Links
Calculating the total capacity of a data network is a notoriously difficult problem, but information theorists are beginning to make some headway. «more» Related Links: The elusive capacity of networks Professor Muriel Medard RLE Network Coding and Reliable...
by RLE at MIT | Apr 1, 2011 | News Links
Secure, synchronized, social TV: A technique called network coding could protect users’ privacy and providers’ content while making communications networks more efficient. «more» Related Links: Secure Synchronized, social TV Professor Muriel Medard RLE...
by RLE at MIT | Feb 12, 2010 | News Links
About 10 years ago, electrical engineers suggested that bundles of data could be transmitted over a network more efficiently if, instead of passing unaltered from one end to the other, they were scrambled together along the way and unscrambled at the end. In 2003,...
