Information Multicast in Planar Networks: Efficient Network Coding Over Small Finite Fields

Network coding encourages in-network mixing of information flows for enhanced network capacity, particularly for multicast data dissemination. While existing theory on multicast network coding often treats the underlying network topology as a black box, the authors show that exploring network-specific properties in the topology can lead to much more efficient network coding solutions, including efficient code assignment algorithms and efficient encoding/decoding operations. They demonstrate such a connection between algebraic coding and graph theory through the class of planar and pseudo planar networks, under the basic yet fundamental setting of multicasting two information flows to an arbitrary number of receivers.

Provided by: University of Calcutta Topic: Networking Date Added: Oct 2012 Format: PDF

Find By Topic