2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | N.2.2 | ||
| Paper Title | On the Gap between Scalar and Vector Solutions of Generalized Combination Networks | ||
| Authors | Hedongliang Liu, Technical University of Munich, Germany; Hengjia Wei, Ben-Gurion University of the Negev, Israel; Sven Puchinger, Technical University of Denmark, Denmark; Antonia Wachter-Zeh, Technical University of Munich, Germany; Moshe Schwartz, Ben-Gurion University of the Negev, Israel | ||
| Session | N.2: Network Coding II | ||
| Presentation | Lecture | ||
| Track | Networking and Network Coding | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | 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. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
