CaltechAUTHORS
  A Caltech Library Service

The encoding complexity of network coding

Langberg, Michael and Sprintson, Alexander and Bruck, Jehoshua (2006) The encoding complexity of network coding. IEEE Transactions on Information Theory, 52 (6). pp. 2386-2397. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06

[img]
Preview
PDF
See Usage Policy.

419kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06

Abstract

In the multicast network coding problem, a source s needs to deliver h packets to a set of k terminals over an underlying communication network G. The nodes of the multicast network can be broadly categorized into two groups. The first group includes encoding nodes, i.e., nodes that generate new packets by combining data received from two or more incoming links. The second group includes forwarding nodes that can only duplicate and forward the incoming packets. Encoding nodes are, in general, more expensive due to the need to equip them with encoding capabilities. In addition, encoding nodes incur delay and increase the overall complexity of the network. Accordingly, in this paper, we study the design of multicast coding networks with a limited number of encoding nodes. We prove that in a directed acyclic coding network, the number of encoding nodes required to achieve the capacity of the network is bounded by h/sup 3/k/sup 2/. Namely, we present (efficiently constructible) network codes that achieve capacity in which the total number of encoding nodes is independent of the size of the network and is bounded by h/sup 3/k/sup 2/. We show that the number of encoding nodes may depend both on h and k by presenting acyclic coding networks that require /spl Omega/(h/sup 2/k) encoding nodes. In the general case of coding networks with cycles, we show that the number of encoding nodes is limited by the size of the minimum feedback link set, i.e., the minimum number of links that must be removed from the network in order to eliminate cycles. We prove that the number of encoding nodes is bounded by (2B+1)h/sup 3/k/sup 2/, where B is the minimum size of a feedback link set. Finally, we observe that determining or even crudely approximating the minimum number of required encoding nodes is an NP-hard problem.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TIT.2006.874434DOIUNSPECIFIED
ORCID:
AuthorORCID
Langberg, Michael0000-0002-7470-0718
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© Copyright 2006 IEEE. Reprinted with permission. Manuscript received March 15, 2005; revised December 20, 2005. [Posted online: 2006-06-05] This work was supported in part by the Caltech Lee Center for Advanced Networking and by the National Science Foundation under Grants ANI-0322475 and CCF-0346991. The material in this paper was presented in part at the IEEE International Symposium on Information theory, Adelaide, Australia, September 2005. Communicated by N. Cai, Guest Editor. We would like to thank Matthew Cook for useful discussions.
Subject Keywords:Coding networks, encoding links, encoding nodes, multicast, network coding
Issue or Number:6
Record Number:CaltechAUTHORS:LANieeetit06
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:5331
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:10 Oct 2006
Last Modified:09 Mar 2020 13:18

Repository Staff Only: item control page