Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2012 Information Theory and Applications Workshop

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/ITA.2012.6181808

Publication Date

2012

Journal or Book Title

IEEE/ACM Transactions on Networking (TON)

Volume

22

Issue

5

First Page

285

Last Page

299

DOI

10.1109/ITA.2012.6181808

Conference Title

2012 Information Theory and Applications Workshop

Conference Date

February 5-10, 2012

City

San Diego, CA

Abstract

We consider a directed acyclic network with unit-capacity edges and n source-terminal (si - ti) pairs that wish to communicate at unit rate via network coding. The connectivity between the si-ti pairs is quantified by means of a connectivity level vector, [k1 k2 ... kn] such that there exist ki edge-disjoint paths between si and ti. In this work we attempt to classify networks based on the connectivity level. Specifically, for case of n = 3, and a given connectivity level vector [k1 k2 k3], we aim to either present a constructive network coding scheme or an instance of a network that cannot support the desired rate. Certain generalizations for the case of higher n have also been found.

Comments

This is a manuscript of a proceeding from the Information Theory and Applications Workshop 22 (2012): 285, doi:10.1109/ITA.2012.6181808. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS