Title :
On the solvability of three-pair networks with common bottleneck links
Author :
Kai Cai ; Guangyue Han
Author_Institution :
Dept. of Math., Univ. of Hong Kong, Hong Kong, China
Abstract :
We consider the solvability problem under network coding and derive a sufficient and necessary condition for 3-pair networks with common “bottleneck links” being solvable. We show that, for such networks: (1) the solvability can be determined in polynomial time; (2) being solvable is equivalent to being linear solvable; (3) finite fields of size 2 or 3 are sufficient to construct linear solutions.
Keywords :
network coding; polynomials; telecommunication links; bottleneck links; network coding; polynomial time; three-pair networks; Communication networks; Educational institutions; Encoding; Network coding; Polynomials; Uplink; A-set; Network coding; k-pair network;
Conference_Titel :
Information Theory Workshop (ITW), 2014 IEEE
Conference_Location :
Hobart, TAS
DOI :
10.1109/ITW.2014.6970891
