A Class of Non-Linearly Solvable Networks

DOI10.1109/TIT.2016.2618379zbMATH Open1359.94923arXiv1601.03803OpenAlexW2532691608MaRDI QIDQ2979095FDOQ2979095

Authors: Joseph Connelly, Kenneth Zeger 

Publication date: 2 May 2017

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

Abstract: For each integer $mgeq2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module alphabet and is not asymptotically linear solvable over any finite-field alphabet. The network's capacity is shown to equal one, and when $m$ is composite, its linear capacity is shown to be bounded away from one for all finite-field alphabets.

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

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

This page was built for publication: A Class of Non-Linearly Solvable Networks

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