On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks

DOI10.1109/TIT.2021.3065364MaRDI QIDQ4958249zbMATH OpenFDO

Authors Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz

Publication date 7 September 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.04870

zbMATH Keywords

generalized combination networknetwork coding solutionsscalar-linear and vector-linear solutions

Mathematics Subject Classification ID

Source coding (94A29) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size. These bounds improve and extend the parameter range of known bounds. Using these new bounds we present a lower bound and an upper bound on the gap in the alphabet size between optimal scalar-linear and optimal vector-linear network coding solutions. For a fixed network structure, while varying the number of middle-layer nodes $r$, the asymptotic behavior of the upper and lower bounds shows that the gap is in $Theta(log(r))$.

Cited in

(1)

• Almost affinely disjoint subspaces and covering Grassmannian codes

This page was built for publication: On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958249)