Generalization of the Fano and Non-Fano Index Coding Instances

A Sharififar, P Sadeghi, N Aboutorab - arXiv preprint arXiv:2407.12215, 2024 - arxiv.org
Matroid theory is fundamentally connected with index coding and network coding problems.
In fact, the reliance of linear index coding and network coding rates on the characteristic of a …

On strongly α-topological vector spaces

HZ Ibrahim - Journal of Interdisciplinary Mathematics, 2022 - Taylor & Francis
This paper is devoted to introduce a new kind of topological vector spaces called strongly α-
topological vector space and study their relationship with other types of topological vector …

Access structures for finding characteristic-dependent linear rank inequalities

V Peña-Macias - Kybernetika, 2023 - dml.cz
Determining information ratios of access structures is an important problem in secret
sharing. Information inequalities and linear rank inequalities play an important role for …

How to Find New Characteristic-Dependent Linear Rank Inequalities using Secret Sharing

V Peña-Macias - arXiv preprint arXiv:2111.00120, 2021 - arxiv.org
Determining information ratios of access structures is an important problem in secret
sharing. Information inequalities and linear rank inequalities play an important role for …

New characteristic dependent linear rank inequalities

VB Peña Macias - repositorio.unal.edu.co
In this work, we develop some methods for producing characteristic-dependent linear rank
inequalities and show some applications to Network Coding and Secrets Sharing. We …