Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2009 | Published
Journal Article Open

Network Coding: A Computational Perspective

Abstract

In this work, we study the computational perspective of network coding, focusing on two issues. First, we address the computational complexity of finding a network code for acyclic multicast networks. Second, we address the issue of reducing the amount of computation performed by network nodes. In particular, we consider the problem of finding a network code with the minimum possible number of encoding nodes, i.e., nodes that generate new packets by performing algebraic operations on packets received over incoming links.

Additional Information

© Copyright 2009 IEEE. Reprinted with permission. Manuscript received July 17, 2006; revised January 21, 2008. Current version published December 24, 2008. This work was supported in part by the Caltech Lee Center for Advanced Networking. Communicated by M. Médard, Associate Editor for Communications. Color versions of Figures 3 and 6–8 in this paper are available online at http://ieeexplore.ieee.org.

Attached Files

Published - LANieeetit09.pdf

Files

LANieeetit09.pdf
Files (616.6 kB)
Name Size Download all
md5:2a7431765ac58ddde20138a08c498011
616.6 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023