Combinatorial flow over cyclic linear networks

Chung Chan; Kenneth W. Shum; Qifu Tyler Sun

doi:10.1109/ITW.2013.6691270

Combinatorial flow over cyclic linear networks

Chung Chan^*, Kenneth W. Shum, Qifu Tyler Sun

^*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

8 Citations (Scopus)

Abstract

A combinatorial notion of flow is identified for timeinvariant linear coding over non-layered deterministic linear networks that may contain cycles, broadcast and interference links. It reveals the matroidal structure for efficient code construction, and enables a seamless extension of the classical network coding results. In particular, the flow can be decomposed efficiently into disjoint information flow paths to support a maximum unicast rate up to the cut-set bound.

Original language	English
Title of host publication	2013 IEEE Information Theory Workshop (ITW )
Publisher	IEEE
ISBN (Electronic)	9781479913237
ISBN (Print)	9781479913213
DOIs	https://doi.org/10.1109/ITW.2013.6691270
Publication status	Published - Sept 2013
Externally published	Yes
Event	2013 IEEE Information Theory Workshop (ITW 2013) - University of Seville, Seville, Spain Duration: 9 Sept 2013 → 13 Sept 2013 http://itw2013.tsc.uc3m.es/

Conference

Conference	2013 IEEE Information Theory Workshop (ITW 2013)
Abbreviated title	ITW 2013
Place	Spain
City	Seville
Period	9/09/13 → 13/09/13
Internet address	http://itw2013.tsc.uc3m.es/

Research Keywords

cyclic network
linear deterministic network
linking system
multicast
network coding

Access Output

10.1109/ITW.2013.6691270

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{f0bf9d9791254161bb2d0c3445d1961b,

title = "Combinatorial flow over cyclic linear networks",

abstract = "A combinatorial notion of flow is identified for timeinvariant linear coding over non-layered deterministic linear networks that may contain cycles, broadcast and interference links. It reveals the matroidal structure for efficient code construction, and enables a seamless extension of the classical network coding results. In particular, the flow can be decomposed efficiently into disjoint information flow paths to support a maximum unicast rate up to the cut-set bound. ",

keywords = "cyclic network, linear deterministic network, linking system, multicast, network coding",

author = "Chung Chan and Shum, {Kenneth W.} and Sun, {Qifu Tyler}",

year = "2013",

month = sep,

doi = "10.1109/ITW.2013.6691270",

language = "English",

isbn = "9781479913213",

booktitle = "2013 IEEE Information Theory Workshop (ITW )",

publisher = "IEEE",

address = "United States",

note = "2013 IEEE Information Theory Workshop (ITW 2013), ITW 2013 ; Conference date: 09-09-2013 Through 13-09-2013",

url = "http://itw2013.tsc.uc3m.es/",

}

TY - GEN

T1 - Combinatorial flow over cyclic linear networks

AU - Chan, Chung

AU - Shum, Kenneth W.

AU - Sun, Qifu Tyler

PY - 2013/9

Y1 - 2013/9

N2 - A combinatorial notion of flow is identified for timeinvariant linear coding over non-layered deterministic linear networks that may contain cycles, broadcast and interference links. It reveals the matroidal structure for efficient code construction, and enables a seamless extension of the classical network coding results. In particular, the flow can be decomposed efficiently into disjoint information flow paths to support a maximum unicast rate up to the cut-set bound.

AB - A combinatorial notion of flow is identified for timeinvariant linear coding over non-layered deterministic linear networks that may contain cycles, broadcast and interference links. It reveals the matroidal structure for efficient code construction, and enables a seamless extension of the classical network coding results. In particular, the flow can be decomposed efficiently into disjoint information flow paths to support a maximum unicast rate up to the cut-set bound.

KW - cyclic network

KW - linear deterministic network

KW - linking system

KW - multicast

KW - network coding

UR - http://www.scopus.com/inward/record.url?scp=84893330125&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84893330125&origin=recordpage

U2 - 10.1109/ITW.2013.6691270

DO - 10.1109/ITW.2013.6691270

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781479913213

BT - 2013 IEEE Information Theory Workshop (ITW )

PB - IEEE

T2 - 2013 IEEE Information Theory Workshop (ITW 2013)

Y2 - 9 September 2013 through 13 September 2013

ER -

Combinatorial flow over cyclic linear networks

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this