In 1969, Strassen shocked the computational world with his subcubic algorithm for
multiplying matrices. Attempting to understand the best possible algorithm for this problem …

The Hoffman ratio bound, Lovász theta function, and Schrijver theta function are classical
upper bounds for the independence number of graphs, which are useful in graph theory …

In this thesis we present several results in coding theory, concerning error-correcting codes
and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in …

We study quantum versions of the Shannon capacity of graphs and non-commutative
graphs. We introduce the asymptotic spectrum of graphs with respect to quantum and …

We introduce a new setting in information theory where a receiver tries to exactly recover a
source signal from a dishonest sender who sends messages with an intention to maximize …

We define the relative fractional independence number of a graph $ G $ with respect to
another graph $ H $, as $$\alpha^*(G| H)=\max_ {W}\frac {\alpha (G\boxtimes W)}{\alpha …

Determining the Shannon capacity of graphs is a long-standing open problem in information
theory, graph theory and combinatorial optimization. Over decades, a wide range of upper …

This doctoral thesis focuses on zero-error information theory, particularly on source coding
with side information, channel coding and source-channel duality. These works revolve …

This paper delves into three research directions, leveraging the Lovász ϑ-function of a
graph. First, it focuses on the Shannon capacity of graphs, providing new results that …

Zero-error coding encompasses a variety of source and channel problems where the
probability of error must be exactly zero. The zero-error constraint differs from the vanishing …