TY - GEN
T1 - On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
AU - Liu, Hedongliang
AU - Wei, Hengjia
AU - Puchinger, Sven
AU - Wachter-Zeh, Antonia
AU - Schwartz, Moshe
N1 - Funding Information: This research was supported by the German Research Foundation (DFG) with a German Israeli Project Cooperation (DIP) under grant no. PE2398/1-1, KR3517/9-1 and by the DFG Emmy Noether Program under grant No. WA3907/1-1. Publisher Copyright: © 2020 IEEE.
PY - 2020/6/1
Y1 - 2020/6/1
N2 - We study scalar-linear and vector-linear solutions to 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. These bounds improve and extend the parameter range of known bounds. Using these new bounds we present a general lower bound on the gap in the alphabet size between scalar-linear and vector-linear solutions.
AB - We study scalar-linear and vector-linear solutions to 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. These bounds improve and extend the parameter range of known bounds. Using these new bounds we present a general lower bound on the gap in the alphabet size between scalar-linear and vector-linear solutions.
UR - http://www.scopus.com/inward/record.url?scp=85090403877&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ISIT44484.2020.9173942
DO - https://doi.org/10.1109/ISIT44484.2020.9173942
M3 - Conference contribution
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1652
EP - 1657
BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020
Y2 - 21 July 2020 through 26 July 2020
ER -