Title :
Combinatorial flow over cyclic linear networks
Author :
Chung Chan ; Shum, Kenneth W. ; Sun, Q.T.
Author_Institution :
Inst. of Network Coding, Chinese Univ. of Hong Kong, Hong Kong, China
Abstract :
A combinatorial notion of flow is identified for time-invariant 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 :
combinatorial mathematics; cyclic codes; linear codes; matrix algebra; broadcast links; code construction; combinatorial flow; cut-set bound; cyclic linear networks; disjoint information flow paths; interference links; matroidal structure; maximum unicast rate up; network coding; nonlayered deterministic linear networks; time-invariant linear coding; Delays; Joining processes; Linear codes; Network coding; Routing; Unicast; cyclic network; linear deterministic network; linking system; multicast; network coding;
Conference_Titel :
Information Theory Workshop (ITW), 2013 IEEE
Conference_Location :
Sevilla
Print_ISBN :
978-1-4799-1321-3
DOI :
10.1109/ITW.2013.6691270
