Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks

Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some constraints on their possible solutions. We then focus on the combination network, which is one of the simplest and most insightful network in network-coding theory. Of particular interest are minimal combination networks. We study the gap in alphabet size between vector-linear and scalar-linear network-coding solutions for such minimal combination networks and some of their sub-networks. For minimal multicast networks with two source messages we find the maximum possible gap. We define and study sub-networks of the combination network, which we call Kneser networks, and prove that they attain the upper bound on the gap with equality. We also prove that the study of this gap may be limited to the study of sub-networks of minimal combination networks, by using graph homomorphisms connected with the $q$ -analog of Kneser graphs. Additionally, we prove a gap for minimal multicast networks with three or more source messages by studying Kneser networks. Finally, an upper bound on the gap for full minimal combination networks shows nearly no gap, or none in some cases. This is obtained using an MDS-like bound for subspaces over a finite field.

[1]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[2]  Moshe Schwartz,et al.  Codes and Anticodes in the Grassman Graph , 2002, J. Comb. Theory, Ser. A.

[3]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[4]  Chris D. Godsil,et al.  Colouring lines in projective space , 2006, J. Comb. Theory, Ser. A.

[5]  Christina Fragouli,et al.  (Secure) Linear network coding multicast , 2016, Des. Codes Cryptogr..

[6]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[7]  Christina Fragouli,et al.  Degraded Multicasting with Network Coding over the Combination Network , 2011, 2011 International Symposium on Networking Coding.

[8]  Alexander Sprintson,et al.  Network Coding in Minimal Multicast Networks , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[9]  Raymond W. Yeung,et al.  Network coding gain of combination networks , 2004, Information Theory Workshop.

[10]  Muriel Médard,et al.  Localized Dimension Growth: A Convolutional Random Network Coding Approach to Managing Memory and Decoding Delay , 2013, IEEE Transactions on Communications.

[11]  Aart Blokhuis,et al.  On the chromatic number of q-Kneser graphs , 2012, Des. Codes Cryptogr..

[12]  Tuvi Etzion,et al.  Vector network coding based on subspace codes outperforms scalar linear network coding , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[13]  Nadine Eberhardt,et al.  Constructions And Combinatorial Problems In Design Of Experiments , 2016 .

[14]  D. Karger,et al.  On Coding for Non-Multicast Networks ∗ , 2003 .

[15]  Frédéric Meunier,et al.  Colorful Subhypergraphs in Kneser Hypergraphs , 2014, Electron. J. Comb..

[16]  Ming Xiao,et al.  A Binary Coding Approach for Combination Networks and General Erasure Networks , 2007, 2007 IEEE International Symposium on Information Theory.

[17]  J. Pintz,et al.  The Difference Between Consecutive Primes , 1996 .

[18]  Alexander Vardy,et al.  MDS array codes with independent parity symbols , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[19]  T. Ho,et al.  On Linear Network Coding , 2010 .

[20]  T. Apostol.  Introduction to analytic number theory , 1976 .

[21]  Aart Blokhuis,et al.  A Hilton-Milner Theorem for Vector Spaces , 2010, Electron. J. Comb..

[22]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[23]  Rudolf Ahlswede,et al.  Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding" , 2006, GTIT-C.

[24]  Zongpeng Li,et al.  Bounding the Coding Advantage of Combination Network Coding in Undirected Networks , 2012, IEEE Transactions on Information Theory.

[25]  Ferdinand Ihringer,et al.  The Chromatic Number of the q-Kneser Graph for Large q , 2019, Electron. J. Comb..

[26]  Christina Fragouli,et al.  Information flow decomposition for network coding , 2006, IEEE Transactions on Information Theory.

[27]  Peter Frankl,et al.  The Erdös-Ko-Rado theorem for vector spaces , 1986, J. Comb. Theory, Ser. A.

[28]  J. Pintz,et al.  The Difference Between Consecutive Primes, II , 2001 .

[29]  Zongpeng Li,et al.  On Vector Linear Solvability of Multicast Networks , 2015, IEEE Transactions on Communications.