Network Coding Solutions for the Combination Network and its Subgraphs

The combination network is one of the simplest and insightful networks in coding theory. The vector network coding solutions for this network and some of its sub-networks are examined. For a fixed alphabet size of a vector network coding solution, an upper bound on the number of nodes in the network is obtained. This bound is an MDS bound for subspaces over a finite field. A family of sub-networks of combination networks is defined. It is proved that for this family of networks, which are minimal multicast networks, there is a gap in the minimum alphabet size between vector network coding solutions and scalar network coding solutions. This gap is obtained for any number of messages and is based on coloring of the q-Kneser graph and a new hypergraph generalization for it.

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

[2]  Christina Fragouli,et al.  Algebraic Algorithms for Vector Network Coding , 2011, IEEE Transactions on Information Theory.

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

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

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

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

[7]  Albrecht Beutelspacher,et al.  A Characteristic Property of Geometric t-Spreads in Finite Projective Spaces , 1991, Eur. J. Comb..

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

[9]  Alexander Vardy,et al.  Error-correcting codes in projective space , 2008, 2008 IEEE International Symposium on Information Theory.

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

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

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

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

[14]  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.

[15]  Guglielmo Lunardon,et al.  Normal Spreads , 1999 .

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

[17]  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).

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

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

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

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

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

[23]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[24]  Moshe Schwartz,et al.  Locality and availability of array codes constructed from subspaces , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[25]  J. Maynard.  On the difference between consecutive primes , 2012, 1201.1787.