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

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

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

34 Downloads (Pure)

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.

Original languageEnglish
Title of host publicationProceedings of 2020 IEEE International Symposium on Information Theory
PublisherIEEE
Publication dateJun 2020
Pages1646-1651
Article number9173942
ISBN (Electronic)9781728164328
DOIs
Publication statusPublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Conference

Conference2020 IEEE International Symposium on Information Theory
CountryUnited States
CityLos Angeles
Period21/07/202026/07/2020
SeriesIEEE International Symposium on Information Theory - Proceedings
Volume2020-June
ISSN2157-8095

Fingerprint Dive into the research topics of 'On the Gap between Scalar and Vector Solutions of Generalized Combination Networks'. Together they form a unique fingerprint.

Cite this